题目来源:https://leetcode.com/problems/merge-k-sorted-lists/
问题描述
23. Merge k Sorted Lists
Hard
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
Example:
Input:
[
1->4->5,
1->3->4,
2->6
]
Output: 1->1->2->3->4->4->5->6
------------------------------------------------------------
题意
合并k个有序单链表为一个有序单链表。
------------------------------------------------------------
思路
时间复杂度最低的方法是开一个新内存放合并表,从每个单链表的头指针开始一个一个选取最小的值放入合并表。如此一来,问题化归为重复N次