Java代码
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode deleteDuplication(ListNode head) {
ListNode dummy = new ListNode(-1);
dummy.next = head;
ListNode p = dummy;
while(p.next != null){
ListNode q = p.next;
while(q != null && p.next.val == q.val) q = q.next;
if(p.next.next == q) p = p.next;
else p.next = q;
}
return dummy.next;
}
}