LeetCode23 合并K个升序链表
描述
给你一个链表数组,每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中,返回合并后的链表。
示例
输入: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
提示
- k = = l i s t s . l e n g t h k == lists.length k==lists.length
- 0 < = k < = 1 0 4 0 <= k <= 10^4 0<=k<=104
- 0 < = l i s t s [ i ] . l e n g t h < = 500 0 <= lists[i].length <= 500 0<=lists[i].length<=500
- − 1 0 4 < = l i s t s [ i ] [ j ] < = 1 0 4 -10^4 <= lists[i][j] <= 10^4 −104<=lists[i][j]<=104
- l i s t s [ i ] lists[i] lists[i] 按升序排列
- l i s t s [ i ] . l e n g t h lists[i].length lists[i].length 的总和不超过 1 0 4 10^4 104
分析
考虑分治两两合并,因此可以使用递归。关键是构造递归方程,寻找递归边界
代码
public class ListNode {
int val;
ListNode next;
ListNode() {}
ListNode(int val) { this.val = val; }
ListNode(int val, ListNode next) { this.val = val; this.next = next; }
}
public ListNode mergeKLists(ListNode[] lists) {
return merge(lists,0, lists.length-1);
}
public ListNode merge(ListNode[] lists,int left,int right){
if (left==right)
return lists[left];
if (left>right)
return null;
int mid=(left+right)/2;
return mergeTwoLists(merge(lists,left,mid),merge(lists,mid+1,right));
}
public ListNode mergeTwoLists(ListNode a, ListNode b){
if (a==null||b==null)
return a==null?b:a;
ListNode dummy = new ListNode(-1);
ListNode p=dummy;
while (a!=null&&b!=null){
if (a.val<=b.val){
p.next=a;
a=a.next;
}else {
p.next=b;
b=b.next;
}
p=p.next;
}
if (a!=null)
p.next=a;
if (b!=null)
p.next=b;
return dummy.next;
}