23. Merge k Sorted Lists
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
Merge k Sorted Lists
题目思路很清楚:将多个已经排序好的链表合并成一个有序的链表。这是一道很经典的题目,在分布式系统中有很广泛的应用,也经常出现在各类的面试题中。这道题的解法并不单一,有很大的开放性,下面是我完成该题目的几种思路,