【Question】
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) {
ListNode *cur,*pre;
cur=head;pre=head;
int temp;
if (pre==NULL) return NULL;
temp=pre->val;
cur=cur->next;
while(cur!=NULL)
{
if (temp==cur->val)
{
pre->next=pre->next->next;
cur=cur->next;
}
else
{
pre=pre->next;
temp=cur->val;
cur=cur->next;
}
}
return head;
}
};