82. Remove Duplicates from Sorted List II

最新推荐文章于 2024-01-17 14:07:10 发布

薛离子

最新推荐文章于 2024-01-17 14:07:10 发布

阅读量292

点赞数

分类专栏： LeetCode LeetCode 文章标签： LeetCode 82 有序列表去重 Remove Duplicates

本文链接：https://blog.csdn.net/teffi/article/details/54425435

版权

LeetCode 同时被 2 个专栏收录

98 篇文章 1 订阅

订阅专栏

LeetCode

98 篇文章 1 订阅

订阅专栏

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.

解题思路：

借用83. Remove Duplicates from Sorted List的思路。

/**
 * 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 == NULL || head->next == NULL) return head;

        ListNode dummy(-1);
        dummy.next = head;

        bool bDif = false;
        ListNode *prev = &dummy;
        ListNode*cur = head;
        ListNode *next = head->next;

        for (; next; next = next->next) {
            if (cur->val == next->val) {        // if duplicate number, delete it
                bDif = true;
                cur->next = next->next;
                delete next;
            }
            else {
                if (bDif) {         // if duplicate number, delete it
                    bDif = false;
                    prev->next = cur->next;
                    delete cur;
                }
                else {              // if not duplicate number, continue next
                    prev = cur;
                }
                cur = next;
            }
        }

        if (bDif) {                 // if duplicate number in end, delete it
            bDif = false;
            prev->next = cur->next;
            delete cur;
        }

        return dummy.next;
    }
};