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){
return head;
}
ListNode * pPre = head;
ListNode * pCur = NULL;
while(pPre->next){
pCur = pPre->next;
if(pCur->val == pPre->val){
pPre->next = pCur->next;
}else{
pPre = pCur;
}
}
return head;
}
};
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if(!head){
return head;
}
ListNode * pPre = head;
ListNode * pCur = NULL;
while(pPre && pPre->next){
pCur = pPre->next;
if(pCur->val == pPre->val){
pPre->next = pCur->next;
}else{
pPre = pPre->next;
}
}
return head;
}
};