[leetcode] 82. Remove Duplicates from Sorted List II

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.

解法一：

借用hash table来记录，非in-place的处理。

/**
 * 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) return NULL;
        
        ListNode* dummy = new ListNode(head->val-1);
        ListNode* res = dummy;
        
        unordered_map<int,int> m;
        
        ListNode* cur = head;
        while(cur&&cur->next){
            m[cur->val]++;
            if(cur->val!=cur->next->val&&m[cur->val]==1) {
                dummy->next = new ListNode(cur->val);
                dummy = dummy->next;
            }
            cur = cur->next;
        }
        if(m[cur->val]==0){
            dummy->next = new ListNode(cur->val);
        }
        
        return res->next;
    }
};

解法二：

核心思想是通过循环跳到相同数字的末尾。

/**
 * 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 || !head->next) return head;
        
        ListNode *start = new ListNode(0);
        start->next = head;
        ListNode *pre = start;
        while (pre->next) {
            ListNode *cur = pre->next;
            while (cur->next && cur->next->val == cur->val) cur = cur->next;
            if (cur != pre->next) pre->next = cur->next;
            else pre = pre->next;
        }
        return start->next;
    }
};