合并k个已排序的链表

合并k 个已排序的链表并将其作为一个已排序的链表返回。分析并描述其复杂度。

示例1
输入：
[{1,2,3},{4,5,6,7}]
返回值：
{1,2,3,4,5,6,7}

分析

归并思想，对链表两两合并直到最后一个链表，代码如下：

import java.util.*;
public class Solution {
    public ListNode mergeKLists(ArrayList<ListNode> lists) {
        /*
        ListNode res = null;
        for(int i = 0; i < lists.size(); i++) {
            res = merge(res,lists.get(i));
        }
        return res;
        */
        return mergeNode(lists);
    }
    public ListNode mergeNode(ArrayList<ListNode> list) {
        if(list.size() <= 0) {
            return null;
        }
       if(list.size() == 1) {
           return list.get(0);
       }
        int begin = 0,end = list.size()-1;
        ArrayList<ListNode> result = new ArrayList();
        while(begin < end) {
            result.add(merge(list.get(begin++),list.get(end--)));
        }
        if(begin == end) {
            result.add(list.get(begin));
        }
        return mergeNode(result);
        
    }
    public ListNode merge(ListNode l1,ListNode l2) {
        if(l1 == null) {
            return l2;
        } 
        if(l2 == null) {
            return l1;
        }
        ListNode head = new ListNode(-1);
        ListNode last = head;
        while(l1 != null && l2 != null) {
            if(l1.val > l2.val) {
                last.next = l2;
                last = l2;
                l2 = l2.next;
            } else {
                last.next = l1;
                last = l1;
                l1 = l1.next; 
            }
        }
       if(l1 != null) {
           last.next = l1;
       } 
        if(l2 != null) {
            last.next = l2;
        }
        return head.next;
        
        
    }
}

时间复杂度o(nlogn)