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
.
给定链表,删除所有重复,使得每个元素只出现一次。
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head==null) return null;
ListNode p = head;
while(p.next!=null){
if(p.next.val== p.val) p.next=p.next.next;//如果下一个节点的data和当前节点一样,把当前结点的指针指向下下个节点
else p=p.next;
}
return head;
}
}