面试题18(二):删除链表中重复的结点
题目:在一个排序的链表中,如何删除重复的结点?例如,在图(a)中重复结点被删除之后,链表如图(b)所示。
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
struct ListNode{
int value;
ListNode* next;
};
void DeleteDuplication(ListNode** pHead){
if(pHead==NULL || *pHead==NULL) return ;
ListNode* pPreNode=NULL;
ListNode* pNode = *pHead;
while(pNode!=NULL){
ListNode* pNext=pNode->next;
bool needDelete=false;
if(pNext!=NULL && pNext->value=pNode->value) needDelete=true;
if(!needDelete){
pPreNode=pNode;
pNode=pNode->next;
}else{
int value=pNode->value;
ListNode* pToDel=pNode;
while(pToDel!=NULL && pToDel->value==value){
pNext=pToDel->next;
delete pToDel;
pToDel=NULL;
pToDel=pNext;
}
if(pPreNode==NULL1) *pHead=pNext;
else pPreNode->next=pNext;
pNode=pNext;
}
}
}
int main() {
return 0;
}