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 NULL;
if (head->next == NULL)
return head;
ListNode* pre = head;
ListNode* pNext = head->next;
while (pNext != NULL)
{
if (pNext->val != pre->val)
{
pre->next=pNext;
pre=pre->next;
}
pNext=pNext->next;
}
pre->next=NULL;
return head;
}
};