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.
pointer ->temp, when pointer changes, head will change especially the sign =, 有赋值符号,因为指向的是同一个对象。temp=temp.next 对head没有影响,这个是指针移动的过程。
public class Solution {
public static ListNode deleteDuplicates(ListNode head) {
ListNode temp=head;
while(temp!=null &&temp.next!=null){
if(temp.val==temp.next.val){
temp.next=temp.next.next;
}else{
temp=temp.next;
}
}
return head;
}
}
referrence: leetcode solutions