leetcode_remove_duplicates_from_sorted_list_ii

发表于

难度：Miduem

解题思路：是系列I的延伸，比较cur->next和cur->next->next，找到重复的地方，然后往后一直数，直到不重复。

代码如下：

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/**
 * 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) {
        ListNode *dummy = new ListNode(-1), *current = dummy;
        dummy->next = head;
        while(current->next != NULL && current->next->next != NULL)
        {
            ListNode *current_n = current->next;
            ListNode *current_n_n = current_n->next;
            if(current_n ->val == current_n_n->val)
            {
                int value = current_n_n->val;
                while(current_n_n->next != NULL && current_n_n->next->val == value)
                {
                    current_n_n = current_n_n->next;
                }
                current->next = current_n_n->next;
            }
            else
            {
                current = current->next;
            }
        }
        return dummy->next;
    }
};

代码结果：9ms，超过20.26%。