Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given1->1->2, return1->2.
Given1->1->2->3->3, return1->2->3.
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *deleteDuplicates(ListNode *head)
{
if(!head)
return head;
ListNode *p = head;
int n = head->val;
ListNode *last = head;
p = p->next;
while(p)
{
if(p->val == n)
{
while(p && p->val == n)
p = p->next;
last->next = p;
}
else
{
n = p->val;
last = p;
p = p->next;
}
}
return head;
}
};