用map记录每个整数出现的次数,重建链表
/**
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
map<int,int> mp;
for(ListNode *tmp=head;tmp!=NULL;tmp=tmp->next)
mp[tmp->val]++;
ListNode *pre=NULL,*res=NULL;
for(ListNode *tmp=head;tmp!=NULL;tmp=tmp->next){
if(mp[tmp->val]==1){
if(pre==NULL){
pre=new ListNode(tmp->val);
res=pre;
}
else{
ListNode *insert=new ListNode(tmp->val);
pre->next=insert;
pre=insert;
}
}
}
return res;
}
};