给你一个链表数组,每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中,返回合并后的链表。
示例 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 = [[]]
输出:[]
自己原来实现的时间复杂度有点高,后面改用了分治法这样可以使得在merge()方法中的时间复杂度降低到O(log(n))的程度。
题解:
/**
* Definition for singly-linked list.
* 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; }
* }
*/
class Solution {
public ListNode mergeKLists(ListNode[] lists) {
if(lists == null || lists.length == 0){
return null;
}
return merge(lists, 0, lists.length -1);
}
public ListNode merge(ListNode[] lists, int left, int right){
int mid = (left + right) >> 1;
if(left == right){
return lists[left];
}
return merge2Lists(merge(lists, mid + 1, right), merge(lists, left, mid));
}
public ListNode merge2Lists(ListNode l1, ListNode l2){
if(l1 == null || l2 == null){
return l1 == null ? l2 : l1;
}
if(l1.val < l2.val){
ListNode head = l1;
head.next = merge2Lists(l1.next, l2);
return head;
}else{
ListNode head = l2;
head.next = merge2Lists(l1, l2.next);
return head;
}
}
}