leetcode 82. Remove Duplicates from Sorted List II

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

原创最新推荐文章于 2024-01-17 14:07:10 发布 · 260 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

58 篇文章

订阅专栏

本文提供了一种从已排序链表中删除所有重复节点的方法，只保留唯一元素，通过一次遍历实现高效处理。

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

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.

public ListNode deleteDuplicates(ListNode head) {
        ListNode resultHead = new ListNode(Integer.MAX_VALUE);
        ListNode resultEnd = resultHead;
        while(head != null){
            if(head.next == null || head.next.val != head.val){
                resultEnd.next = head;
                head = head.next;
                resultEnd = resultEnd.next;
                resultEnd.next = null;
            }
            else{
                while(head.next != null && head.val == head.next.val)
                    head = head.next;
                head = head.next;
            }
        }
        return resultHead.next;
    }