Leetcode Problem 23. Merge k Sorted Lists

23. Merge k Sorted Lists

Leetcode Solutions

If the list of linked-lists is empty, return null.
Initialize an interval i with 1.
While i is less than the length of the list of linked-lists: a. Loop over the list of linked-lists and merge lists at index j and j + i. b. Store the merged list back at index j. c. Increment j by 2 * i to move to the next pair of lists to merge. d. Double the interval i.
After the loop, the first list in the list of linked-lists will be the fully merged list. Return this list.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen