题目描述
在一个排序的链表中,存在重复的结点,请删除该链表中重复的结点,重复的结点不保留,返回链表头指针。 例如,链表1->2->3->3->4->4->5 处理后为 1->2->5
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};
*/
class Solution {
public:
ListNode* deleteDuplication(ListNode* pHead)
{
if(!pHead || !pHead->next)
return pHead;
ListNode *newH = new ListNode(0);
newH->next = pHead;
ListNode *pre = newH;
ListNode *cur = pHead;
ListNode *next = pHead->next;
while(cur && next)
{
if(next->val != cur->val)
{
pre = cur;
cur = next;
next = next->next;
}
else
{
while(next && next->val == cur->val)
next = next->next;
cur = pre->next = next;
if(next)
next = next->next;
}
}
return newH->next;
}
};