public class Solution {
public ListNode deleteDuplication(ListNode pHead){
if(pHead == null)
return pHead;
ListNode dummy = new ListNode(-1);
dummy.next = pHead;
ListNode pre = dummy;
ListNode cur = dummy.next;
while(cur != null){
if(cur.next != null && cur.val == cur.next.val){
//找到最后一个相等的结点
while(cur.next != null && cur.val == cur.next.val){
cur = cur.next;
}
pre.next = cur.next;
cur = pre.next;
}
else{
pre = pre.next;
cur = cur.next;
}
}
return dummy.next;
}
}