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