Remove Duplicates from Sorted List II ---LeetCode

https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/

解题思路：
类似于 Remove Duplicates from Sorted List 的思想，只不过本题要求将重复的所有元素都删掉，那么这时我们需要一个 prev 指针来辅助，将 prev 指针指向 curr.next 的过程就能将重复元素都删除。同时，需要一个 while 循环来找到重复元素的最后一个。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        if (head == null || head.next == null) return head;

        ListNode dummy = new ListNode(0);
        dummy.next = head;
        ListNode prev = dummy;
        ListNode curr = head;

        while (curr != null) {
            while (curr.next != null && prev.next.val == curr.next.val)
                curr = curr.next;
            if (prev.next == curr)
                prev = prev.next;
            else
                prev.next = curr.next;

            curr = curr.next;
        }
        return dummy.next;
    }
}