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
.
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head==null) return head;
ListNode p=head;
while(p.next!=null)
{
while(p.next.val==p.val)
{
if(p.next.next==null)
{
p.next=null;
return head;
}
else p.next=p.next.next;
}
p=p.next;
}
return head;
}
}