[LeetCode]23. Merge k Sorted Lists
2019-06-07
阅读 2 分钟
1kMerge k sorted linked lists and return it as one sorted list. Analyzeand describe its complexity.Example: Input: [ 1->4->5, 1->3->4, 2->6 ] Output: 1->1->2->3->4->4->5->6要减小算法的复杂度,就要利用已知的条件,已知的条件就是已有的顺序。