郴州网站制作公司哪家好,wordpress开发环境搭建,淘客怎么做推广网站,国家反诈中心app下载二维码题目#xff1a;合并 k个排序链表#xff0c;返回合并后的排序链表。请分析和描述算法的复杂度。示例:输入:[1-4-5,1-3-4,2-6]输出: 1-1-2-3-4-4-5-6#xfeff;分析#xff1a;和合并两个链表差不多#xff0c;采用归…题目合并 k个排序链表返回合并后的排序链表。请分析和描述算法的复杂度。示例:输入:[1-4-5,1-3-4,2-6]输出: 1-1-2-3-4-4-5-6分析和合并两个链表差不多采用归并排序那种分治思想两两排序合并答案public static ListNode mergeKLists(ListNode[] lists) {if(lists.length0){return null;}return mergeKLists(lists,0,lists.length-1);}public static ListNode mergeKLists(ListNode[] lists,int low,int high) {if(lowhigh){return lists[low];}int midlow((high-low)1);ListNode node1mergeKLists(lists,low,mid);ListNode node2mergeKLists(lists,mid1,high);return mergeTwoLists(node1,node2);}public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {if (l1 null) {return l2;}else if (l2 null) {return l1;}else if (l1.val l2.val) {l1.next mergeTwoLists(l1.next, l2);return l1;}else {l2.next mergeTwoLists(l1, l2.next);return l2;}}
