Remove Duplicates from Sorted List

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

Spencer_Lin

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

阅读量316

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode LinkedList

本文链接：https://blog.youkuaiyun.com/linxiang0591/article/details/37758451

LeetCode LinkedList 专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一种从已排序链表中删除所有重复元素的方法，确保每个元素仅出现一次。通过双指针技巧实现，当发现重复元素时跳过它们，并继续检查后续节点。

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

Given a sorted linked list, delete all duplicates such that each element appear only once.

For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.

Check for the coding detail below

 /*
    Key to solve: two points
    1. curr point =head &  next point =head.next
    2. two cases:
        2.1 duplication was found, skip it
        2.2 move both curr and next nodes forward

     */
    public static ListNode deleteDuplicates(ListNode head) {
        //check for corner case
        if(head==null || head.next==null) return head;
        ListNode curr=head;
        ListNode nextNode=curr.next;
        while(nextNode!=null){
            //duplication was found
            if(curr.val==nextNode.val){
                //skip duplicated node
                curr.next=nextNode.next;
                //move nextNode to next Node
                nextNode=nextNode.next;
            }else {
                //move both curr and nextNode forward
                curr = curr.next;
                nextNode = nextNode.next;
            }
        }
        return head;
    }