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
.
1.
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head==null||head.next==null)
return head;
ListNode pre=head;
ListNode now=head.next;
while(true){
if(now.next==null){
if(now.val==pre.val)
pre.next=null;
break;
}
if(now.val==pre.val){
now=now.next;
pre.next=now;
}
else{
pre=now;
now=now.next;
}
}
return head;
}
}
2.
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode list=head;
while(list!=null){
if(list.next==null)
break;
if(list.val==list.next.val)
list.next=list.next.next;
else
list=list.next;
}
return head;
}
}
3.