题目:合并两个排序的链表
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
输入:l1 = [1,2,4], l2 = [1,3,4]
输出:[1,1,2,3,4,4]
思想:使用小顶堆(优先队列)
public class MergeLinkedNode {
public static void main(String[] args) {
ListNode root1 = new ListNode(1);
ListNode n1 = new ListNode(2);
ListNode n2 = new ListNode(4);
ListNode n3 = new ListNode(9);
root1.next = n1;
n1.next = n2;
n2.next = n3;
ListNode root2 = new ListNode(2);
ListNode n4 = new ListNode(3);
ListNode n5 = new ListNode(8);
root2.next = n4;
n4.next = n5;
System.out.println(mergeNew(root1, root2));
}
private static ListNode mergeNew(ListNode n1, ListNode n2) {
if (n1 == null) {
return n2;
}
if (n2 == null) {
return n1;
}
Queue<ListNode> queue = new PriorityQueue<>(Comparator.comparingInt(o -> o.val));
queue.add(n1);
queue.add(n2);
ListNode newHead = new ListNode(0);
ListNode temp = newHead;
while (queue.size() > 0) {
// 弹出来,加入新链表
ListNode smaller = queue.poll();
temp.next = smaller;
temp = temp.next;
// 如果还有后续,则继续
if (smaller.next != null) {
queue.add(smaller.next);
}
}
return newHead.next;
}
}