编写代码,移除未排序链表中的重复节点。保留最开始出现的节点。
示例1:
输入:[1, 2, 3, 3, 2, 1]
输出:[1, 2, 3]
示例2:
输入:[1, 1, 1, 1, 2]
输出:[1, 2]
提示:
链表长度在[0, 20000]范围内。
链表元素在[0, 20000]范围内。
进阶:
如果不得使用临时缓冲区,该怎么解决?
题解:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode removeDuplicateNodes(ListNode head) {
if(head == null || head.next == null){
return head;
}
HashSet<Integer> set = new HashSet<>();
ListNode newhead = new ListNode(-1);
ListNode p = newhead;
while(null != head) {
if(!set.contains(head.val)){
p.next = head;
p = p.next;
set.add(head.val);
head = head.next;
}else{
p.next = head.next;
head = head.next;
}
}
return newhead.next;
}
}
如果不用缓冲区,需要用时间换空间,那么题解为:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode removeDuplicateNodes(ListNode head) {
if(head == null || head.next == null){
return head;
}
ListNode pre = head;
ListNode next;
ListNode p;
while(pre != null ) {
p = pre;
next = p.next;
while(next != null){
// 如果和上层循环相同的话,删除next指向的节点
if(next.val == pre.val){
p.next = next.next;
next = next.next;
}else{
p = p.next;
next =next.next;
}
}
pre = pre.next;
}
return head;
}
}