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) {
        int len=lists.length;
        ListNode newlist=null;
        
        for(int i=0;i<len;i++){
        	if(lists[i]==null)
        		continue;
        	newlist=mergeTwoLists(newlist,lists[i]);        	
        }
        
        return newlist;
    }
    
    private static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode newlist=new ListNode(0);   
        ListNode head=newlist;
        
        while(l1!=null && l2!=null){
        	if(l1.val<l2.val){
        		head.next=l1;
        		l1=l1.next;
        		head=head.next;
        	}
        	else{
        		head.next=l2;
        		l2=l2.next;
        		head=head.next;
        	}
        }
        
        if(l1==null)
        	head.next=l2;
        if(l2==null)
        	head.next=l1;
        
        return newlist.next;
    }
}