采用分治算法每两个合并之后的链表继续合并
/*
* @lc app=leetcode.cn id=23 lang=java
*
* [23] 合并K个排序链表
*
* https://leetcode-cn.com/problems/merge-k-sorted-lists/description/
*
* algorithms
* Hard (48.23%)
* Likes: 438
* Dislikes: 0
* Total Accepted: 63.7K
* Total Submissions: 132.1K
* Testcase Example: '[[1,4,5],[1,3,4],[2,6]]'
*
* 合并 k 个排序链表,返回合并后的排序链表。请分析和描述算法的复杂度。
*
* 示例:
*
* 输入:
* [
* 1->4->5,
* 1->3->4,
* 2->6
* ]
* 输出: 1->1->2->3->4->4->5->6
*
*/
// @lc code=start
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode mergeKLists(ListNode[] lists) {
if (lists == null || lists.length == 0) return null;
return mergeKLists(lists, 0, lists.length - 1);
}
private ListNode mergeKLists(ListNode[] lists, int l, int r){
if (r == l)
return lists[l];
int mid = l + (r - l) / 2;
ListNode l1= mergeKLists(lists, l , mid);
ListNode l2 = mergeKLists(lists, mid + 1, r);
return mergeTwoLists(l1, l2);
}
private ListNode mergeTwoLists(ListNode l1, ListNode l2){
if (l1 == null)
return l2;
if (l2 == null)
return l1;
if (l1.val < l2.val) {
l1.next = mergeTwoLists(l1.next, l2);
return l1;
} else {
l2.next = mergeTwoLists(l1, l2.next);
return l2;
}
}
}
// @lc code=end