题目
//在一个排序的链表中,存在重复的结点,请删除该链表中重复的结点,重复的结点不保留,返回链表头指针。 例如,链表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 (NULL == pHead)
return pHead;
ListNode *head = new ListNode (-1);
head->next = pHead;
ListNode *pre = head, *cur = pHead;
while(NULL != cur)
{
if (NULL != cur->next && cur->val == cur->next->val)
{
while(NULL != cur->next && cur->val == cur->next->val)
{
cur = cur->next;
}
cur = cur->next;
pre->next = cur;
}
else
{
pre = cur;
cur = cur->next;
}
}
return head->next;
}
};