删除链表中的所有节点 [英] Remove all nodes in linked list

问题描述

我有一个链表包含 3 个节点，如图所示:

I have a linked list contains 3 nodes like the image shown:

有一个head指针和temp1指针指向链表的前端，尾点指向链表的尾部.

There is a head pointer and temp1 pointer point to the front of the list, and tail point points at the end of the list.

我想删除所有节点，并将其改回原来的初始形式( tail = NULL, head = first_node ，但第一个节点在数据和下一个字段中没有任何值).

I want to remove all the nodes, and change it back to its original initial form ( tail = NULL, head = first_node , but the first node doesn't have any value in the data and next field).

因为我想开始在其中添加一些新值.要删除所有这些数据，此代码是否将删除此链表中的节点并留下第一个节点，数据和下一个字段中没有值?

Because I want to start putting up some new values in it. To remove all those data, is this code going to remove nodes inside this linked list and left with the first node with no values in data and next field?

此代码是用 C++ 编写的:

This code is in C++:

while(temp1!=tail)
{
    temp1 = temp1->next;
    if(temp1->next == tail)
    {
        tail=temp1;
        temp1 = temp1->next;
        free(temp1);    
    }
}

但是，这是否意味着只有最后一个节点会被删除?有没有办法删除除第一个节点以外的所有节点?

But then, does this mean only the last node will be deleted? are there any way to delete all the nodes except the first one?

推荐答案

要删除除第一个节点以外的所有节点，可以试试下面的代码.

To delete all nodes except the first node, you can try below code.

temp1 = head->next;
while(temp1!=NULL) // as I am considering tail->next = NULL
{   
    head->next = temp1->next;
    temp1->next = NULL;
    free(temp1);
    temp1 = head->next;
}

这将删除除第一个节点之外的所有节点.但第一个节点的数据将保持原样.

This will delete all nodes except first one. But the data with the first node will remain as it is.

这篇关于删除链表中的所有节点的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！