Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
输入
Input: [ 1->4->5, 1->3->4, 2->6 ]
输出
Output: 1->1->2->3->4->4->5->6
提示
合并 K 个有序链表