GoLang Solution For LeetCode Problem: Merge k Sorted Lists
Solving Merge k Sorted Lists in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
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
See the full details of the problem Merge k Sorted Lists at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go