LeetCode 82. Remove Duplicates from Sorted List II

问题描述

• 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.
• 地址

问题分析

• 该题是 LeetCode 83. Remove Duplicates from Sorted List 的进阶题目。同 剑指offer-删除链表中重复的节点 一样。
• 值得注意的依旧是，当涉及到有可能改变头结点时，有以下两种方法可尝试
  
  • dummy 节点
  • 递归

代码实现

• dummy 节点

    public ListNode deleteDuplicates(ListNode head) {
        if (head == null || head.next == null) {
            return head;
        }
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        ListNode preNode = dummy;
        ListNode curNode = head;
        while (curNode != null) {
            int val = curNode.val;
            ListNode nextNode = curNode.next;
            if (nextNode != null && nextNode.val == val) {
                while (nextNode != null && nextNode.val == val) {
                    nextNode = nextNode.next;
                }
                preNode.next = nextNode;
                curNode = preNode.next;
            }else {
                preNode = curNode;
                curNode = nextNode;
            }
        }
        return dummy.next;
    }

• 递归

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