[Lintcode]Remove Duplicates from Sorted List

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#lintcode

算法专栏收录该内容

191 篇文章

订阅专栏

本文提供了一种从已排序链表中删除所有重复元素的方法，确保每个元素仅出现一次。通过一个简洁的Java实现示例，展示了如何遍历链表并去除重复项。

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

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

Example

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

public class Solution {
    /**
     * @param ListNode head is the head of the linked list
     * @return: ListNode head of linked list
     */
    public static ListNode deleteDuplicates(ListNode head) { 
        if(head == null || head.next == null) return head;
        ListNode prev = head;
        ListNode cur = head.next;
        while(cur != null) {
            if(cur.val == prev.val) cur = cur.next;
            else {
                prev.next = cur;
                prev = prev.next;
                cur = cur.next;
            }
        }
        prev.next = cur;//init the pointer of last node.
        return head;
        
    }  
}