Leetcode 82：Remove Duplicates from Sorted List II

最新推荐文章于 2024-05-15 23:21:40 发布

原创最新推荐文章于 2024-05-15 23:21:40 发布 · 104 阅读

0 ·

CC 4.0 BY-SA版权

算法题专栏收录该内容

118 篇文章

订阅专栏

本文介绍了一种算法，用于从已排序的链表中移除所有具有重复数值的节点，仅保留原始列表中的唯一数值。通过示例展示输入为1->2->3->3->4->4->5时，输出为1->2->5；输入为1->1->1->2->3时，输出为2->3。提供了C++代码实现。

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

Example 1:

Input: 1->2->3->3->4->4->5
Output: 1->2->5
Example 2:

Input: 1->1->1->2->3
Output: 2->3

C++
 ListNode* deleteDuplicates(ListNode* head) {
        ListNode* cur = head;
        ListNode* pre = new ListNode(-1);
        ListNode* preHead = pre;
        pre->next = cur;
        while(pre->next&&pre->next->next)
        {
            if(pre->next->val == pre->next->next->val)
            {
                ListNode* pcheck = pre->next;
                int k = pcheck->val;
                while(pcheck&&pcheck->val == k)
                {
                    pcheck = pcheck->next;
                    delete pre->next;
                    pre->next = pcheck;
                }
            }
            else
                pre = pre->next;
        }
        return preHead->next;
    }