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
.
/**
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (!head)
return NULL;
ListNode *pNewHead;
ListNode *pCur;
ListNode *pPre;
pNewHead = pCur = pPre = head;
pCur = pCur->next;
while (pCur)
{
while (pCur && (pCur->val == pPre->val))
{
ListNode *pTmp = pCur;
pPre->next = pCur->next;
pCur = pCur->next;
delete pTmp;
}
if (!pCur)
break;
pCur = pCur->next;
pPre = pPre->next;
}
return pNewHead;
}
};