参考
http://blog.csdn.net/havenoidea/article/details/12883673
class Solution
{
public:
ListNode *deleteDuplicates(ListNode *head)
{
if(head==NULL)
return head;
ListNode *newHead = new ListNode(0);
newHead ->next = head;
ListNode *pre, *now;
pre = newHead;
now = head;
while(now!=NULL&&now->next!=NULL)
{
if(now->val==now->next->val)
{
while(now->next!=NULL&&now->val==now->next->val)
now = now->next;
pre->next = now ->next;
now = now->next;
}
else
{
pre = now;
now = now->next;
}
}
return newHead->next;
}
};