82. Remove Duplicates from Sorted List II

Alden He

于 2019-04-30 22:31:49 发布

阅读量149

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/u014683187/article/details/89373445

版权

LeetCode 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

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

public ListNode deleteDuplicates(ListNode head) {
        if(head==null||head.next==null)return head;
        ListNode root=head.next;
        if(head.next!=null&&head.next.val==head.val){
            while (head.next!=null&&head.next.val==head.val){
                head=head.next;
            }
            head=head.next;
            return deleteDuplicates(head);
        }else{
            head.next=deleteDuplicates(head.next);
            return head;
        }
    }