Leetcode 23. 合并K个排序链表

合并 k 个排序链表，返回合并后的排序链表。请分析和描述算法的复杂度。

示例:

输入:
[
  1->4->5,
  1->3->4,
  2->6
]
输出: 1->1->2->3->4->4->5->6

/**
 * 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){
			return null;
		}
        int len = lists.length;
        int temp =1;
        while(temp < len){
            for(int i = 0; i + temp < len; i +=2*temp){
                lists[i] = merge(lists[i],lists[i + temp]);
            }
            temp *= 2;
        }
        //一开始写的是return list[0]  无法提交通过，想了一下没有对lists进行判断

        return len != 0 ? lists[0] : null;
    }

   public ListNode merge(ListNode l1, ListNode l2){
		ListNode res = new ListNode(0);
		ListNode tail = res;
		while(l1 != null && l2 != null){
			if(l1.val < l2.val){
				tail.next = l1;
				l1 = l1.next;
			}else {
				tail.next = l2;
				l2 = l2.next;
			}
			tail = tail.next;
		}
		if(l1 != null){
			tail.next = l1;
		}else{
			tail.next = l2;
		}
		return res.next;
   }    
}