内容:记录一下刷题的过程
首先附上源码
#include <iostream>
using namespace std;
typedef struct Node
{
int m_nValue;
struct Node* pNext;
}ListNode;
void DeleteNode(ListNode** pHead, ListNode* pToBeDelete)
{
if (pHead == nullptr || pToBeDelete == nullptr)
return;
//被删除的节点不是尾节点
if (pToBeDelete->pNext != nullptr)
{
ListNode *pNext = pToBeDelete->pNext;
pToBeDelete->m_nValue = pNext->m_nValue;
pToBeDelete->pNext = pNext->pNext;
delete pNext;
pNext = nullptr;
}
//被删除节点是头结点
else if (*pHead == pToBeDelete)
{
delete pToBeDelete;
pToBeDelete = nullptr;
*pHead = nullptr;
}
else//待删除节点是尾节点
{
ListNode* pNode = *pHead;
while (pNode->pNext != pToBeDelete)
{
pNode = pNode->pNext;
}
pNode->pNext = nullptr;
delete pToBeDelete;
pToBeDelete = nullptr;
}
}
void Test()
{
ListNode* pHead = new ListNode;
ListNode* pNode1 = new ListNode;
ListNode* pNode2 = new ListNode;
ListNode *pNode = pHead;
pHead->m_nValue = 1;
pNode1->m_nValue = 2;
pNode2->m_nValue = 3;
pHead->pNext = pNode1;
pNode1->pNext = pNode2;
pNode2->pNext = nullptr;
while (pNode != nullptr)
{
printf("%d ", pNode->m_nValue);
pNode = pNode->pNext;
}
DeleteNode(&pHead, pNode1);
pNode = pHead;
while (pNode != nullptr)
{
printf("%d ", pNode->m_nValue);
pNode = pNode->pNext;
}
cout << pHead->m_nValue;
delete pHead;
delete pNode1;
pHead = nullptr;
pNode1 = nullptr;
}
int main()
{
Test();
system("pause");
return 0;
}
这里是结果
思路:把下一个节点的内容复制到需要删除的节点上覆盖原有的内容,再把下一个节点删除,那就相当于把当前需要删除的节点删除了。
这里隐藏了一个BUG,我们删除pNode1的时候是把它后一个值覆盖了前一个值,我们删除的是pNode2,最后我们释放内存的时候要delete pNode1,这点需要非常注意。
PS:这些都是个人观点,如果哪里有错误的,欢迎评论区批评指正^ - ^