题目
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 static ListNode deleteDuplicates(ListNode head) {
if (head==null || head.next==null) return head;
ListNode first = head;
ListNode second=head.next;
while(second!=null){
if(first.val==second.val){
second=second.next;
first.next=second;
}
else{
first=first.next;
second=first.next;
}
}
return head;
}
/********************************
* 本文来自博客 “李博Garvin“
* 转载请标明出处:http://blog.csdn.net/buptgshengod
******************************************/