Given a sorted linked list, delete all duplicates such that each element appear only once.
Example 1:
Input: 1->1->2
Output: 1->2
Example 2:
Input: 1->1->2->3->3
Output: 1->2->3
class ListNode {
int val;
ListNode next;
ListNode(int x) { val = x; }
}
class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode p = head;
ListNode pre = head;
while(p!=null){
while(p.next!=null && p.next.val == p.val) p = p.next;
p = p.next;
pre.next = p;
pre = p;
}
return head;
}
}