https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list/
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) {
if (head == NULL) {
return head;
}
ListNode *pPrev = head;
ListNode *pCurr = head->next;
while(pCurr != NULL) {
if (pCurr->val == pPrev->val) {
pPrev->next = pCurr->next;
delete pCurr;
} else {
pPrev = pPrev->next;
}
pCurr = pPrev->next;
}
return head;
}
};