Leetcode - 82. Remove Duplicates from Sorted List II

最新推荐文章于 2023-08-30 08:07:21 发布

_浮生_

最新推荐文章于 2023-08-30 08:07:21 发布

阅读量108

点赞数

分类专栏： leetcode 文章标签：链表

本文链接：https://blog.csdn.net/zqxf123456789/article/details/107968586

版权

leetcode 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

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

Return the linked list sorted as well.

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

class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        ListNode dummy(-1);
        ListNode* prev = &dummy;
        dummy.next = head;
        
        ListNode* head2 = prev;
        prev = prev->next;
        ListNode* cur;
        while(prev)
        {
            cur = prev->next;
            while(prev && cur && prev->val != cur->val)
            {
                prev = prev->next;
                cur = prev->next;
                head2 = head2->next;
            }
            
            while(prev && cur && prev->val == cur->val)
            {
                prev = prev->next;
                cur = prev->next;
                head2->next = cur;
            }
            prev = cur;
        }
        
        return dummy.next;
 }