problem23

README

< Previous 　　　　　　　　　　　　　　　　 Next >

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

Related Topics

[Heap] [Linked List] [Divide and Conquer]

Similar Questions

1. Merge Two Sorted Lists (Easy)
2. Ugly Number II (Medium)