leetcode82:删除排序链表中的重复元素II

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        ListNode* newhead=head;
        ListNode* last(newhead);
        map<int,bool> m;
        while(newhead!=nullptr){
            newhead = newhead->next;
            if(newhead!=nullptr){
                if(newhead->val==last->val){
                    m[newhead->val] = true;
                }
                last = last->next;
            }
        }
        ListNode reshead(1000);
        ListNode* node = &reshead;
        while(head!=nullptr){
            if(m[head->val]==true) {
                head = head->next;
            }
            else{
                node->next = head;
                node = node->next;
                head = head->next;
                node->next =nullptr;
            }
        }
        return reshead.next;
    }
};