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 ListNode deleteDuplicates(ListNode head) {
if(head==null||head.next==null)
return head;
ListNode list=head;
ListNode pre=head;
ListNode current=head.next;
while(current!=null)
{
if(pre.val==current.val)
pre.next=current.next;
else
{
pre=current;
}
current=current.next;
}
return list;
}