给定一个排序链表,删除所有重复的元素,使得每个元素只出现一次。
示例 1:
输入: 1->1->2
输出: 1->2
示例 2:
输入: 1->1->2->3->3
输出: 1->2->3
import java.util.HashSet;
import java.util.Set;
class Solution {
public ListNode deleteDuplicates(ListNode head) {
if (head == null) return null;
ListNode prior = head;
Set set = new HashSet();
set.add(prior.val);
while (prior.next != null) {
if (set.contains(prior.next.val)) {
ListNode free = prior.next;
prior.next = free.next;
free = null;
} else {
set.add(prior.next.val);
prior = prior.next;
}
}
return head;
}
}
class Solution {
public ListNode deleteDuplicates(ListNode head) {
if (head == null) return null;
ListNode prior = head;
while (prior != null && prior.next != null) {
if (prior.val == prior.next.val) {
ListNode free = prior.next;
prior.next = free.next;
free = null;
} else {
prior = prior.next;
}
}
return head;
}
}