Question:
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;
* next = null;
* }
* }
*/
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
if (head == null || head.next == null)
return head;
ListNode backhead = new ListNode(0);
backhead.next = head;
ListNode pre = backhead;
ListNode cur = head;
ListNode nex = head.next;
boolean delstate = false;
while (nex != null) {
if (nex.val == cur.val) {
delstate = true;
} else {
if (delstate) {
pre.next = nex;
delstate = false;
} else {
pre = cur;
}
}
cur = nex;
nex = nex.next;
}
if(delstate)
pre.next = null;
return backhead.next;
}
}