移除链表的重复节点（简单题）

哈希+双指针，很轻松的小题。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* removeDuplicateNodes(ListNode* head) {
        if(head==NULL)return NULL;
        unordered_set<int>myset={head->val};
        ListNode*prev=head;
        ListNode*cur=head->next;
        while(cur!=NULL)
        {
            if(myset.find(cur->val)==myset.end())
            {
                myset.insert(cur->val);
                prev=cur;
                cur=cur->next;
            }
            else
            {
                prev->next=cur->next;
                cur=cur->next;
            }
        }
        return head;

    }
};