Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
For example,
Given 1->2->3->3->4->4->5
, return 1->2->5
.
Given 1->1->1->2->3
, return 2->3
.
思路:用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) {
if(head==NULL || head->next==NULL) return head;
map<int,int> dup;
ListNode *temp=head;
while(temp!=NULL){
if(dup.find(temp->val)==dup.end()){
dup[temp->val]=1;
}else{
dup[temp->val]++;
}
temp=temp->next;
}
ListNode *tempres=new ListNode(0);
ListNode *res=tempres;
while(head!=NULL){
if(dup[head->val]==1){
tempres->next=head;
tempres=tempres->next;
}
head=head->next;
}
tempres->next=NULL;
return res->next;
}
};