描述
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; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode tempHead = new ListNode(1);
ListNode tail = tempHead;
while(head != null){
if(head.next != null && head.next.val == head.val){
int temp = head.val;
while(head != null && head.val == temp){
head = head.next;
}
}else{
tail.next = head;
tail = head;
head = head.next;
tail.next = null;
}
}
return tempHead.next;
}
}