题目:
给你一个链表数组,每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中,返回合并后的链表。
示例 1:
输入:lists = [[1,4,5],[1,3,4],[2,6]]
输出:[1,1,2,3,4,4,5,6]
解释:链表数组如下:
[
1->4->5,
1->3->4,
2->6
]
将它们合并到一个有序链表中得到。
1->1->2->3->4->4->5->6
示例 2:
输入:lists = []
输出:[]
示例 3:
输入:lists = [[]]
输出:[]
提示:
k == lists.length
0 <= k <= 10^4
0 <= lists[i].length <= 500
-10^4 <= lists[i][j] <= 10^4
lists[i] 按 升序 排列
lists[i].length 的总和不超过 10^4
思路:前面有一个题目是两个链表的合并,现在是k个,将k个链表的合并分成若干个两个链表的合并,采用递归实现。
Java代码:
package top100;
import java.util.List;
public class Demo23 {
public ListNode mergeKLists(ListNode[] lists){
//参考Demo21 两个链表的合并 分治法
if (lists == null || lists.length == 0)
return null;
if (lists.length == 1)
return lists[0];
if (lists.length == 2)
return mergeTowLists(lists[0],lists[1]);
int mid = lists.length/2;//取中间的节点 分治
ListNode[] leftLists = new ListNode[mid];
for (int i=0;i<mid;i++){
leftLists[i] = lists[i];
}
ListNode[] rightLists = new ListNode[lists.length - mid];
for (int i=0;i<rightLists.length;i++){
rightLists[i] = lists[i+mid];
}
ListNode leftNode = mergeKLists(leftLists);
ListNode rightNode = mergeKLists(rightLists);
return mergeTowLists(leftNode,rightNode);
}
//这里用递归实现一下两个链表的合并
private ListNode mergeTowLists(ListNode l1, ListNode l2) {
if (l1 == null)
return l2;
if (l2 == null)
return l1;
ListNode node = null;
if (l1.val >= l2.val){
node = l2;
node.next = mergeTowLists(l1, l2.next);
}else {
node = l1;
node.next = mergeTowLists(l1.next,l2);
}
return node;
}
}