题目:
Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2
, return 1->2
.
Given 1->1->2->3->3
, return 1->2->3
.
Remove Duplicates的链表版,设置一个指向已处理好的链表的尾部的指针tail,一个当前访问的节点的指针cur,还有一个指向前驱的指针pre。
当cur.val == pre.val时,cur,pre后移,如果不相等,tail.next指向cur,pre = cur,cur= cur.next,被删除的节点会由于没有引用指向它而被JVM GC掉
public static ListNode deleteDuplicates(ListNode head) {
if(head == null) return null;
ListNode cur = head.next;
ListNode pre = head;
while(cur != null){
if(cur.val == pre.val){
pre.next = cur.next;
cur.next = null;
cur = pre.next;
continue;
}
pre = cur;
cur = cur.next;
}
return head;
}