BM5 合并k个已排序的链表

描述

合并 k 个升序的链表并将结果作为一个升序的链表返回其头节点。

数据范围：节点总数 0≤n≤5000，每个节点的val满足 ∣val∣<=1000

要求：时间复杂度 O(nlogn)

示例1

输入：

[{1,2,3},{4,5,6,7}]

复制返回值：

{1,2,3,4,5,6,7}

import java.util.*;
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode mergeKLists(ArrayList<ListNode> lists) {
        return divide(lists, 0, lists.size() - 1);
    }

    public static ListNode divide(ArrayList<ListNode> lists, int left, int right) {
        if(left > right) {
            return null;
        } else if(left == right) {
            return lists.get(left);
        }
        int mid = (left + right) / 2;
        return Merge(divide(lists, left, mid), divide(lists, mid + 1, right));
    }

    public static ListNode Merge(ListNode list1, ListNode list2) {
        if(list1 == null) {
            return list2;
        } 
        if(list2 == null) {
            return list1;
        }
        ListNode head = new ListNode(0);
        ListNode cur = head;
        while(list1 != null && list2 != null) {
            if(list1.val <= list2.val) {
                cur.next = list1;
                list1 = list1.next;
            } else  {
                cur.next = list2;
                list2 = list2.next;
            }
            cur = cur.next;
        }
        if(list1 != null) {
            cur.next = list1;
        }
        if(list2 != null) {
            cur.next = list2;
        }
        return head.next;
    }

   
}