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;
* next = null;
* }
* }
*/
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode newHead = new ListNode(0);
ListNode tail = newHead;
Set<Integer> set = new HashSet<Integer>();
ListNode p = head;
while( p!=null ){
if( !set.contains(p.val) ){
set.add(p.val);
tail.next = new ListNode(p.val);
tail = tail.next;
}
p = p.next;
}
return newHead.next;
}
}