开始刷leetcode day13：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.

Java:

/**
 * 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 newhead = new ListNode(0);
        newhead.next = head;
        head = newhead;
        ListNode l1 = head;
        
        while(l1.next != null && l1.next.next!= null)
        {
            if(l1.next.val == l1.next.next.val)
            {
                int k = l1.next.val;
                while(l1.next != null && l1.next.val == k)
                {
                    l1.next = l1.next.next;
                }
            }else{
                l1 = l1.next;
            }
        }
        
        return head.next;
        
    }
}