LeetCode::Remove Duplicates from Sorted List II

最新推荐文章于 2025-05-22 22:12:37 发布

原创最新推荐文章于 2025-05-22 22:12:37 发布 · 267 阅读

0 ·

CC 4.0 BY-SA版权

c++ 同时被 3 个专栏收录

13 篇文章

订阅专栏

algorithm

13 篇文章

订阅专栏

leetcode

13 篇文章

订阅专栏

本文介绍了一种算法，用于从排序链表中移除所有重复节点，仅保留唯一值。通过示例展示了如何将包含重复数字的链表转换为只含有不重复数字的链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list-ii/

en 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.

/**
 * 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 *pHead = new ListNode(head->val + 1);
        pHead->next = head;
        ListNode *pPrev = pHead;
        ListNode *pCurr = pHead;
        ListNode *pDelete = NULL;

        while(pCurr != NULL) {
            if (pCurr->next != NULL && pCurr->next->val == pCurr->val) {
                do {
                    pDelete = pCurr->next;
                    pCurr->next = pCurr->next->next;
                    delete(pDelete);
                } while(pCurr->next != NULL && pCurr->next->val == pCurr->val);

                pDelete = pCurr;
                pCurr = pCurr->next;
                delete(pDelete);

                pPrev->next = pCurr;

                continue;
            }

            pPrev = pCurr;
            pCurr = pCurr->next;
        }

        head = pHead->next;
        pDelete = pHead;
        delete(pDelete);

        return head;
    }
};