Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2
, return 1->2
.
Given 1->1->2->3->3
, return 1->2->3
.
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if(head == NULL)
return head;
ListNode* flag = head;
ListNode* p = head->next;
while(p != NULL)
{
if(flag->val != p->val)
{
flag->next = p;
flag = p;
}else{
flag->next = NULL;
}
p = p->next;
}
return head;
}
};