LeetCode刷题005 合并K个升序链表

合并K个升序链表

题目

给你一个链表数组，每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中，返回合并后的链表。

示例 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

题解

分治，时间复杂度O(nlogn)

Code：

/**
 * 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.length == 0){
            return null;
        }
        return mergeLists(lists, 0, lists.length - 1);
    }

    public static ListNode mergeLists(ListNode[] lists, int l, int r){
        if(l == r){
            return lists[l];
        }
        if(r - l == 1){
            return mergeList(lists[l], lists[r]);
        }
        int mid = (l + r) / 2;
        ListNode listLeft = mergeLists(lists, l, mid);
        ListNode listRight = mergeLists(lists, mid + 1, r);
        return mergeList(listLeft, listRight);
    }

    public static ListNode mergeList(ListNode l1, ListNode l2){
        if(l1 == null && l2 == null){
            return null;
        }
        ListNode p = null, q = null;
        int num1 = l1 != null ? l1.val : 10010;
        int num2 = l2 != null ? l2.val : 10010;
        if(num1 <= num2){
            p = l1;
            l1 = l1.next;
        }else{
            p = l2;
            l2 = l2.next;
        }
        q = p;
        while(l1 != null && l2 != null){
            if(l1.val <= l2.val){
                q.next = l1;
                q = q.next;
                l1 = l1.next;
            }else{
                q.next = l2;
                q = q.next;
                l2 = l2.next;
            }
        }
        while(l1 != null){
            q.next = l1;
            q = q.next;
            l1 = l1.next;
        }
        while(l2 != null){
            q.next = l2;
            q = q.next;
            l2 = l2.next;
        }
        q.next = null;
        return p;
    }
}