#include<iostream>
#include<vector>
using namespace std;
struct ListNode
{
int L_value;
ListNode* L_next;
};
//往链表结尾添加节点
void AddToTail(ListNode** pHead, int value)
{
ListNode* pNew = new ListNode();
pNew->L_value = value;
pNew->L_next = nullptr;
if (*pHead == nullptr)
{
*pHead = pNew;
}
else
{
ListNode* pNode = *pHead;
while (pNode->L_next != nullptr)
{
pNode = pNode->L_next;
}
pNode->L_next = pNew;
}
}
//找到第一个含有某值的节点并删除它
void RemoveNode(ListNode** pHead, int value)
{
if (pHead == nullptr || *pHead == nullptr)
{
return;
}
ListNode* pToBeDelte = nullptr;
if ((*pHead)->L_value == value)
{
pToBeDelte = *pHead;
*pHead = (*pHead)->L_next;
}
else
{
ListNode* pNode = new ListNode;
pNode = *pHead;
while (pNode->L_next!=nullptr && pNode->L_next->L_value!= value)
{
pNode = pNode->L_next;
}
if (pNode->L_next != nullptr && pNode->L_next->L_value == value)
{
pToBeDelte = pNode->L_next;
pNode->L_next = pNode->L_next->L_next;
}
}
if (pToBeDelte != nullptr)
{
delete pToBeDelte;
pToBeDelte = nullptr;
}
}
int main()
{
ListNode* n_head = new ListNode();
ListNode* head = new ListNode();
n_head = head;
head->L_value = 0;
head->L_next = nullptr;
ListNode* p = new ListNode();
p->L_value = 1;
p->L_next = nullptr;
head->L_next = p;
AddToTail(&n_head, 2);
RemoveNode(&n_head, 2);
//cout << head->L_next->L_next->L_value;
cin.get();
return 0;
}
删除列表中特定值的节点:首先判断表头是否为空,然后判断表头的值是否为value。然后用while循环找到值为value的节点。用一个指针(ptobedelete)存储值为value的节点,删除的方法为让value的前一个节点指向value的下一个节点,然后delete ptobedelete。