Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode dummy = new ListNode(0);
dummy.next = head;
ListNode preNode = dummy, curNode = head;
while (curNode != null) {
while (curNode.next != null && curNode.val == curNode.next.val) {
curNode = curNode.next;
}
if (preNode.next != curNode) {
preNode.next = curNode.next;
}
else {
preNode = preNode.next;
}
curNode = curNode.next;
}
return dummy.next;
}
}