//使用大根堆解决 public ListNode mergeKLists(ArrayList<ListNode> lists) { PriorityQueue<Integer> pq = new PriorityQueue<>((x, y) -> y - x); ListNode head = new ListNode(-1); for (ListNode node : lists) { while(node != null) { ...