Leetcode(Java)-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; }
 * }
 */
 /**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode mergeKLists(ListNode[] lists) {
        ListNode res = null;
        for(int i=0;i<lists.length;i++)
        {
            res = mergeTwoLists(res,lists[i]);
        }
        return res;
    }
    private ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode sentinel = new ListNode(0);
        ListNode curr =sentinel;
        while(l1!=null || l2!=null){
            if(l1==null)
            {
                curr.next = l2;
                curr = l2;
                l2=l2.next;
                continue;
            }
            if(l2==null)
            {
                curr.next = l1;
                curr = l1;
                l1=l1.next;
                continue;
            }
 
            if(l1.val < l2.val)
            {
                curr.next = l1;
                curr = l1;
                l1=l1.next;
            }
            else
            {
                curr.next = l2;
                curr = l2;
                l2=l2.next;
            }
        }
        return sentinel.next;
    }
}