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.
**[code]**Remove Duplicates from Sorted List
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head==null || head.next==null)return head;
ListNode p=head, q=head.next, prev=head;
while(q!=null)
{
while(q!=null && prev.val==q.val)
{
prev=prev.next;
q=q.next;
}
p.next=q;
p=q;
if(q==null)break;
prev=prev.next;
q=q.next;
}
return head;
}
}