/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if(head == NULL || head->next == NULL)
return head;
ListNode* temp=head;
ListNode* cur=head->next;
while(cur!=NULL)
{
if(cur->val==temp->val)
{
temp->next=cur->next;
}else
{
temp=cur;
}
cur=cur->next;
}
return head;
}
};