题解 | #合并k个已排序的链表#
合并k个已排序的链表
https://www.nowcoder.com/practice/65cfde9e5b9b4cf2b6bafa5f3ef33fa6
import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * public ListNode(int val) { * this.val = val; * } * } */ public class Solution { /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param lists ListNode类ArrayList * @return ListNode类 */ public ListNode mergeKLists (ArrayList<ListNode> lists) { // write code here Queue<ListNode> q=new PriorityQueue<>((v1,v2)->v1.val-v2.val); ListNode dummpy=new ListNode(-1); ListNode res=dummpy; for(ListNode node:lists){ if(node!=null){ q.add(node); } } while(!q.isEmpty()){ ListNode tmp=q.remove(); dummpy.next=tmp; dummpy=dummpy.next; if(tmp.next!=null) q.add(tmp.next); } return res.next; } }