更改链接列表

您可以在所有节点上迭代，直到每次值的最后一个节点打印为：

void printList(node *pHead)
{
    while(pHead)
    {
        cout << pHead->val << endl;
        pHead = pHead->pNext;
    }
}

，在呼叫删除之前，请

printList(pList);

删除整个列表

只需删除列表，将每个节点删除直至最终null。完成后，通过地址传递的头指针将包含null。

void deleteList(node **pHead)
{
    while (*pHead)
    {
        node *tmp = *pHead;
        *pHead = tmp->pNext;
        delete tmp;
    }
}

这是根据输入值删除任何节点的代码：

void deleteNode(node *pHead, int valToDelete)
{
    node* pTmp     = pHead;
    node* pCurrent = pHead;
    node* pNext    = NULL;
//1 checking for wether valToDelete to be deleted does exist
    for(; pTmp; pTmp = pTmp->pNext)
    {
        if(pTmp->val == valToDelete)
            break;
    }
//if valToDelete to be deleted doesn't exist pop up a message and return
    if(!pTmp)
    {
        cout << valToDelete << ": Can't be found!n";
        return;
    }
    int NextValue = 0;
    for(;;)
    {
        //if valToDelete to be deleted is on the head node
        if(pHead->val == valToDelete)
        {
            //store the next to head node
            pTmp = pHead->pNext;
            //delete head node
            delete pHead;
            //assign the head new node (node after the original head)
            pHead = pTmp;
            //exiting gracefully
            return;
        }
        //moving to next node
        pNext = pCurrent->pNext;
        NextValue = pNext->val;
        //checking next node value with valToDelete to be deleted. if they
        //match delete the next node
        if(NextValue == valToDelete)
        {
            //next node holds the target valToDelete so we want its next node
            //and store it in pTmp;
            pTmp = pNext->pNext;
            //pCurrent doesn't yet hold the target value to delete but it is the
            //previous node to target node
            //change the next node of pCurrent so that it doesn't
            //point to the target node but instead to the node right
            //after it
            pCurrent->pNext = pTmp;
            //delete the target node (holds the target value to delete) 
            delete pNext;
            //exit
            return;
        }
        //if pNext doesn't point to target node move to the next node
        //by making pCurrent points to the next node in the list
        pCurrent = pNext;
    }
}

类似的东西？PS：未经测试，可能是一个错误，但您明白了。

void printList(node **pHead)
{
    std::cout << "PRINTING THE LIST";
    int i=0;
    while(nullptr != *pHead){
        std::cout << "ITEM NUMBER "<<i<<" IS "<<*pHead->val;
        *pHead=*pHead->pNext;
        i++;
    }
}

函数以打印链接列表

void print_list(node *ptr)
{
   if (ptr!=NULL)
   {
      cout<<"nElements in the List are : ";
      
      while(ptr!=NULL)
      {
         cout<<ptr->data<<" ";
         ptr = ptr->next;
      }
      
      cout<<endl;
   }
   else
      cout<<"nLink-List is Emptyn";
   }
} 

函数删除整个链接列表。

void delete_list()
{
    if (length != 0)   //length is a variable that stores the length of linkedlist
    {
        while(list_length!=0) 
        {
            remove_tail(); // function that removes tail node from the linkedlist
            list_length--;
        }
        
        head =NULL;
        cout<<"nLink-List Deletedn";
    }
        else
        cout<<"nLink-List is Already Emptyn";
    }
}