Given a sorted linked list, delete all duplicates such that each element appear only once.
Example 1:
Input: 1->1->2 Output: 1->2
Example 2:
Input: 1->1->2->3->3 Output: 1->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||!head->next){
return head;
}
ListNode* p1=head;
ListNode* p2=head->next;
while(p2){
if(p2->val==p1->val){
p1->next=p2->next;
p2=p2->next;
}
else{
p1=p2;
p2=p2->next;
}
}
return head;
}
};