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
.
Subscribe to see which companies asked this question
/**
* 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)
{
ListNode* x=head;
if(!head||!(head->next))
return head;
ListNode* y=head->next;
while(x->val==y->val)
{
x=y;
y=y->next;
if(!y)
break;
}
head=x;
if(y)
{
while(y->next)
{
if((y->val)==(x->val))
x->next=y->next;
else
x=y;
y=y->next;
}
if(x->val==y->val)
x->next=NULL;
else
y->next=NULL;
}
return head;
}
};