题目描述
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};
*/
class Solution {
public:
ListNode* deleteDuplication(ListNode* pHead)
{
if(pHead==NULL) return NULL;
map<int,int> M;
ListNode result(0);
ListNode* fast=pHead;
ListNode* TT=&result;
while(fast)
{
M[fast->val]++;
fast=fast->next;
}
while(pHead)
{
if(M[pHead->val]==1)
{
TT->next=pHead;
TT=pHead;
}
pHead=pHead->next;
}
TT->next=NULL;
return result.next;
}
};