如何更新链表中的数据？

Question

我在空闲时间学习链表。所以现在我想学习如何修改用户在链表中输入的数据，但我对这些指针有点迷茫。该程序运行但在我进入年龄后程序停止工作。我认为问题出在 while 循环中的 current=current->next; 上，但我不知道除了 next 之外，当前还应该指向哪里。

void node::update()
{
    int updateAge;
    cout << "Please enter age: ";
    cin>>updateAge;
    int ch;
    node *current = start_ptr;
    node *temp;

    if (start_ptr == NULL)
        cout << "No record to update!" << endl;
    else
    {
        current = start_ptr;

        while((current!=NULL) && (current->temp->age!=updateAge))
        {
            current=current->next; // Is this correct?
        }

        if (current==NULL)
            {cout<<"The Requested age is Not Found" << endl;}


        else if(current->temp->age==updateAge)
        {
            cout<<"What Information You Want To Update?" << endl;
            cout<<"1. Name" << endl;
            cout<<"2. Height" << endl;
            cin>>ch;
            system("cls");

            switch(ch)
            {
                case 1 :
                {
                    cout << "Enter New Name: ";
                    cin.ignore();
                    getline(cin, current->temp->name);
                    break;
                }

                case 2 :
                {
                    cout<<"Enter New Height: ";
                    cin >> current->temp->height;
                    break;
                }

                default:
                {
                    cout<<"Wrong Input! Please choose again: ";
                    cin>>ch;
                }
            }
            cout<<"RECORD UPDATED !";
        }
    }
}

struct list
{
    list *head, *tail;
    list *next;
};

class node
{
    private:
        std::string name; // Name
        int age; // Age in integer
        float height; // In meters

    public:
        node *next; // Pointer to next node
        node *head, *tail;
        node *start_ptr = NULL; // Start Pointer (root)
        node *temp;
        node *temp2;
        node *pNextValue;
        node* prev; // empty header

        void update();
        void printList();
        void delete_end_node();
        void search();
        void sort_age();

    node()
        {
            head = NULL;
            tail = NULL;
        }


        void getInput()
        {
            temp = new node;
            cout << "Name: ";
            cin >> temp->name;
            cout << "Age: ";
            cin >> temp->age;
            cout << "Height: ";
            cin >> temp->height;

            cout<<"\n";
            temp->next = NULL; // Sets the node to be the last node
            if (start_ptr == NULL)
                start_ptr = temp;
            else
            {
                temp2 = start_ptr; // We know temp2 is not NULL - list not empty!
                while (temp2->next != NULL) // The loop will terminate when temp2
                    temp2 = temp2->next; // points to the last node in the list
                // Move to next link in chain
                temp2->next = temp; // Sets the pointer from that last node to point
                                    // to the node that has just declared
            }
        } // End of getInput() function
}; //End of class

Answer 1

我认为你的 while 条件有问题 **尝试删除 temp 然后尝试我认为它会工作 **

条件应该是 current->age!=updatAge