[解決済み] リンクリストの検索機能 - C++ [終了しました]。

質問

私の目的は、すでにリストに入っている番号を検索し、見つかったことを表示する関数を作成することです。
私の最初のアイデアは、番号を見つけるまでリストを検索する（その後削除する）私のremove関数に従うことでした。
これは、検索機能をコード化する論理的な方法と思われました。もしこれが正しくないとしたら、リストを検索して数字が見つかったことを表示するには、どのように修正すればよいのでしょうか？
私はノード *head、*current、*temp とノードポインタを持っています。 次 と 番号 を.hファイル上のクラスでデータ型として使用することができます。
ありがとうございました。
ノート - search()関数の下に私のremove()関数を使用しました。

#include <iostream>                                                 
#include <string>                                                   
#include <fstream>                                                  
#include "LinkedList.h"

using namespace SDI;

int main()
{
    LinkedList menu;

    menu.insert(5);                     
    menu.insert(4);
    menu.insert(2);
    menu.insert(3);
    menu.insert(8);
    menu.remove(4);
    menu.reverse();
    menu.display();
    menu.search(2);
    system("pause");

};


LinkedList::LinkedList()            
{
    head = NULL;
    current = NULL;
    temp = NULL;
};


LinkedList::~LinkedList()           
{

};


void LinkedList::insert(int add)                                    //insert function, data is stored in add from function body
{
    Node* newnode = new Node;                                       //definition of add node, make new node and make node* point to it
    newnode->next = NULL;                                           //point and set up to last node in the list (nothing)
    newnode->number = add;                                          //adds data to list

    if (head != NULL)                                               //if head is pointing to object then we have list
    {
        current = head;                                             //make current pointer point to head
        while (current->next != NULL)                               //check to see if end at list, is it the last node?
        {
            current = current->next;                                //advances current pointer to end of list
        }
        current->next = newnode;                                    //adds new node next to value already stored
    }
    else
    {
        head = newnode;                                             //if we don't have element in list
    }
};


void LinkedList::remove(int remove)                                 //remove function, data is stored in remove from function body
{
    Node* remove1 = NULL;                                           //searches through for same value in remove and deletes
    temp = head;
    current = head;
    while (current != NULL && current->number != remove)            //check if current node is one we want to delete...if not advance current pointer to next one
    {
        temp = current;                                             //keep temp pointer one step behind
        current = current->next;                                    //advance to next node, traverse list till at the end
    }
    if (current == NULL)                                            //pass through whole list and value not found
    {
        std::cout << "N/A\n";
        delete remove1;                                             //removes spare number floating around in memory
    }
    else
    {
        remove1 = current;                                          //pointing to value we want to delete
        current = current->next;                                    //advances current pointer to next node
        temp->next = current;                                       //stops hole that occurs in list, patches this up
        if (remove1 == head)                                        //if pointer is pointing to front of list
        {
            head = head->next;                                      //advance the head to next
            temp = NULL;
        }

        delete remove1;
    }
};


void LinkedList::search(int searchNum)
{
    Node* searchnumber = nullptr;
    temp = head;
    current = head;

    while (current != NULL && current->number != searchNum)
    {
        temp = current;
        current = current->next;
    }
    if (current != NULL)
    {
        searchnumber = current;
        current = current->next;
        std::cout << "-" << searchnumber << " Found";
    }
    else
    {
        std::cout << "N/A";
    }
};


void LinkedList::display()
{
    current = head;                                                 //point to start of list

    while (current != NULL)                                         //while it points to something in list
    {
        std::cout << current->number;                               //display list starting from start
        current = current->next;                                    //advance to next pointer
    }
};


void LinkedList::reverse()
{
    Node *new_head = nullptr;                                       //create new head as we want it to start from last element

    for (current = head; current;)                                  //same as display, ask it to go through list from head then outside loop assign to new head and switch sides
    {
        temp = current;                                             //keep temp pointer one step behind
        current = current->next;                                    //goes through each element in the list
        temp->next = new_head;                                      //scrolls through backwards from new head
        new_head = temp;                                            
    }

    head = new_head;                                                //assign head to new head
};

解決方法は？

検索アルゴリズムが間違っているようです。以下のように変更してください。

if (current != NULL) // (current == NULL) is wrong because it means the value wasn't found
{
    searchnumber = current;
    current = current->next;
    std::cout << "-" << searchnumber->number << " Found"; // here searchnumber is the node's address. You need to print its value, so use searchnumber->number
}

そして、目的の値を見つけるまでノードを削除する必要はありません。
検索アルゴリズムを使って、すでにリストにある数字があるかどうかを探せばいいのです。それが目的ならね。