/**
* 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) {
vector<int> dup;
ListNode* curr=head;
while(curr&&curr->next)
{
if(curr->val==curr->next->val)
{
ListNode* temp=curr->next;
curr->next=curr->next->next;
delete temp;
if(dup.empty()||dup[dup.size()-1]!=curr->val)
dup.push_back(curr->val);
}
else
curr=curr->next;
}
int i=0;
while(head&&i!=dup.size()&&head->val==dup[i])
{
ListNode* temp=head;
head=head->next;
delete temp;
i++;
}
curr=head;
while(curr&&curr->next&&i!=dup.size())
{
if(curr->next->val==dup[i])
{
ListNode* temp=curr->next;
curr->next=curr->next->next;
delete temp;
i++;
}
else
curr=curr->next;
}
return head;
}
};
09-24