题目描述
给你一个链表数组,每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中,返回合并后的链表。
示例 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
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-k-sorted-lists
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
思路
分治,两两合并
class Solution {
public ListNode mergeKLists(ListNode[] lists) {
return helpMerge(lists,0,lists.length-1);
}
public ListNode helpMerge(ListNode[] lists, int left, int right){
if(left == right){
return lists[left];
}
if(left > right){
return null;
}
int mid = left + (right-left)/2;
return mergeTwoLists(helpMerge(lists,left,mid),helpMerge(lists,mid+1,right));
}
public ListNode mergeTwoLists(ListNode list1, ListNode list2){
if(list1 == null || list2 == null){
return list1 != null ? list1:list2;
}
ListNode head = new ListNode(-1);
ListNode temHead = head;
while(list1 != null && list2 != null){
if(list1.val < list2.val){
temHead.next = list1;
list1 = list1.next;
}else{
temHead.next = list2;
list2 = list2.next;
}
temHead = temHead.next;
}
temHead.next = list1 != null ? list1:list2;
return head.next;
}
}