C++双向链表搜索和删除

Question

我在查找列表中的节点然后将其删除时遇到问题。我已经尝试了很多方法，但到目前为止这是我的代码。我不知道问题是在我的插件中还是在我的显示功能中？我几乎没学过这个。

void removeStudent(int id)
{
    node *trash = NULL;

    node *current = head;
    while ( current!= NULL)
    {
        if ( current->data.id == id)
        {
            trash = current;
            current->prev->next = current->next;
            current->next->prev = current->prev;
            delete trash;


        }
    }


}

这是我的插入函数

    void push(student s)
{

    node *tmp = new node;
    tmp->data = s;
    tmp->next = head;
    tmp->prev = NULL;

    if (head == NULL)
    {
        head = tmp;
        tail = tmp;
    }
    else
    {
        head->prev = tmp;
        head = tmp;
    }

}

这是我的显示功能

void display()
{
    node *current = head;

    while (current!=NULL)
    {
        cout << current->data.name << endl;
        cout << current->data.GPA << endl;
        cout << current->data.id << endl;
        cout << current->data.university << endl;
        current = current->next;
    }
}

Answer 1

尝试以下操作。我想您的类还包含数据成员 tail。

void removeStudent( int id )
{
    node *current = head;

    while ( current != NULL && current->data.id != id ) current = current->next;

    if ( current != NULL )
    {
       if ( current->prev != NULL ) current->prev->next = current->next;
       else head = current->next;

       if ( current->next != NULL ) current->next->prev = current->prev;
       else  tail = current->prev;

       delete current;
    }
}

如果你的类没有数据成员 tail 那么你必须删除语句

       else  tail = current->prev;

来自函数体。