/**
* 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) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
ListNode *curr=head;
ListNode *prev=NULL;
while(curr)
{
if(!prev)
{
prev=curr;
}
else if(prev->val!=curr->val)
{
prev->next=curr;
prev=prev->next;
}
curr=curr->next;
}
if(prev) prev->next=NULL;
return head;
}
};
* 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) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
ListNode *curr=head;
ListNode *prev=NULL;
while(curr)
{
if(!prev)
{
prev=curr;
}
else if(prev->val!=curr->val)
{
prev->next=curr;
prev=prev->next;
}
curr=curr->next;
}
if(prev) prev->next=NULL;
return head;
}
};