链表02——在O(1)时间内删除链表节点
剑指offer13题
编程之美3.4 从无头单链表删除节点,也是这个道理,狸猫换太子。
题目:在给定单向链表的头指针和一个节点指针,定义一个函数在O(1)时间删除该节点
分析:
一般思路是从头开始遍历,但是时间复杂度为O(n),
要想O(1),就从指定节点开始,把下一节点的值复制给该节点,然后指向下下节点删除该节点即可。
要考虑:1、节点不是尾节点,按上述删除
2.节点是尾节点,要从头遍历,且把删节点前的指针指向空。
3.只有一个节点,就要删节点,且把头指针置空
关于指定节点的选取时想了好大会,最后得知是要一个个建节点,然后指定节点就好了。
#include<iostream>
using namespace std;
struct ListNode
{
int data;
ListNode* pNext;
};
//构造链表
ListNode* InsertNode(ListNode* &pHead,int data)
{
ListNode* pNew = new ListNode();
pNew->data = data;
pNew->pNext = NULL;
if(NULL == pHead)
{
pHead = pNew;
}
else
{
ListNode* pNode = pHead;
while(pNode->pNext != NULL)
pNode = pNode->pNext;
pNode->pNext = pNew;
}
return pNew;
}
//删除指定节点
void DeleteNode(ListNode* &pHead,ListNode* pToBeDeleted)
{
if(!pHead || !pToBeDeleted)
return;
//先判断是不是尾节点
if(pToBeDeleted->pNext != NULL)
{
ListNode* pNextOne = pToBeDeleted->pNext;//复制下个节点
pToBeDeleted->data = pNextOne->data;//把下个节点赋值给要删除的节点
pToBeDeleted->pNext = pNextOne->pNext;//要删除的节点直接指向下下个,然后删除下个节点
delete pNextOne;
pNextOne = NULL;
}
//链表只有一个节点
else if(pHead == pToBeDeleted)
{
delete pToBeDeleted;
pToBeDeleted = NULL;
pHead = NULL;
}
//是尾节点,需要从头遍历
else
{
ListNode* pNode = pHead;
while(pNode->pNext != pToBeDeleted)
pNode = pNode->pNext;
pNode->pNext = NULL;
delete pToBeDeleted;
pToBeDeleted = NULL;
}
}
//输出链表
void PrintList(ListNode* &pHead)
{
if(NULL == pHead)
return;
ListNode* pNode = pHead;
while (NULL != pNode)
{
cout << pNode->data << " ";
pNode = pNode->pNext;
}
cout << endl;
}
int _tmain(int argc, _TCHAR* argv[])
{
int num = 0;
ListNode* pHead = NULL;
ListNode* pToBeDeleted = NULL;
ListNode* pNode1 = InsertNode(pHead,1);
ListNode* pNode2 = InsertNode(pHead,3);
ListNode* pNode3 = InsertNode(pHead,5);
ListNode* pNode4 = InsertNode(pHead,7);
ListNode* pNode5 = InsertNode(pHead,9);
cout << "输出原来的链表:" << endl;
PrintList(pHead);
DeleteNode(pHead,pNode3);
cout << "输出删除节点3后的链表:" << endl;
PrintList(pHead);
system("pause");
return 0;
}