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.
public class Solution { public ListNode deleteDuplicates(ListNode head) { // Start typing your Java solution below // DO NOT write main() function ListNode sent = new ListNode(0); sent.next = head; ListNode cur = head, prev = sent; while(cur!=null){ boolean dup = false; while(cur.next !=null && cur.val == cur.next.val){ dup = true; cur = cur.next; } if(dup){ prev.next = cur.next; } else{ prev = cur; } cur = cur.next; } return sent.next; } }