Package g0001_0100.s0023_merge_k_sorted_lists

Class Solution

java.lang.Object

g0001_0100.s0023_merge_k_sorted_lists.Solution

public class Solution
extends Object

23 - Merge k Sorted Lists.<p>Hard</p> <p>You are given an array of <code>k</code> linked-lists <code>lists</code>, each linked-list is sorted in ascending order.</p> <p><em>Merge all the linked-lists into one sorted linked-list and return it.</em></p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> lists = [[1,4,5],[1,3,4],[2,6]]</p> <p><strong>Output:</strong> [1,1,2,3,4,4,5,6]</p> <p><strong>Explanation:</strong> The linked-lists are: [ 1->4->5, 1->3->4, 2->6 ] merging them into one sorted list: 1->1->2->3->4->4->5->6</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> lists = []</p> <p><strong>Output:</strong> []</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> lists = [[]]</p> <p><strong>Output:</strong> []</p> <p><strong>Constraints:</strong></p> <ul> <li><code>k == lists.length</code></li> <li><code>0 <= k <= 10^4</code></li> <li><code>0 <= lists[i].length <= 500</code></li> <li><code>-10^4 <= lists[i][j] <= 10^4</code></li> <li><code>lists[i]</code> is sorted in <strong>ascending order</strong>.</li> <li>The sum of <code>lists[i].length</code> won&rsquo;t exceed <code>10^4</code>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
ListNode	mergeKLists(ListNode[] lists)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

mergeKLists

public ListNode mergeKLists(ListNode[] lists)