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.

Subscribe to see which companies asked this question

这也用说？

/**
 * 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)return head;
        ListNode a = new ListNode(head.val-1);
        a.next=head;
        ListNode last = a;
        ListNode cur = head;
        // int tem = a.val;
        while(cur!=null&&cur.next!=null){
            if(cur.val==cur.next.val){
                int tem = cur.val;
                while(cur!=null&&cur.val==tem){
                    cur=cur.next;
                }
                last.next=cur;
            }else{
                last.next=cur;
                last=last.next;
                cur=cur.next;
            }
        }
        last.next=cur;
        return a.next;
    }
}