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