Remove Duplicates from Sorted List II （read and think again!）

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.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {    //362ms
    public ListNode deleteDuplicates(ListNode head) {
        if (head == null || head.next == null){
        	return head;
        }
        ListNode pre = head;
        ListNode cur = head.next;
        ListNode dummy = new ListNode(-1);
        dummy.next = head; 
        head = dummy;
        while (cur != null){
        	if (pre.val == cur.val){
        		while (cur != null && (pre.val == cur.val)){
        			cur = cur.next;
        		}
        		head.next = cur;	
        	}
        	else {
        		head = pre;
        	}
        	pre = cur;
        	if (cur != null){
        	    cur = cur.next;
        	}
        }
        return dummy.next;
    }
}