merge-k-sorted-lists

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an array of <code>k</code> linked-lists <code>lists</code>, each linked-list is sorted in ascending order.

Merge all the linked-lists into one sorted linked-list and return it.

&nbsp;
Example 1:

<pre>
Input: lists = [[1,4,5],[1,3,4],[2,6]]
Output: [1,1,2,3,4,4,5,6]
Explanation: The linked-lists are:
[
 1-&gt;4-&gt;5,
 1-&gt;3-&gt;4,
 2-&gt;6
]
merging them into one sorted list:
1-&gt;1-&gt;2-&gt;3-&gt;4-&gt;4-&gt;5-&gt;6
</pre>

Example 2:

<pre>
Input: lists = []
Output: []
</pre>

Example 3:

<pre>
Input: lists = [[]]
Output: []
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>k == lists.length</code></li>
	<li><code>0 &lt;= k &lt;= 104</code></li>
	<li><code>0 &lt;= lists[i].length &lt;= 500</code></li>
	<li><code>-104 &lt;= lists[i][j] &lt;= 104</code></li>
	<li><code>lists[i]</code> is sorted in ascending order.</li>
	<li>The sum of <code>lists[i].length</code> will not exceed <code>104</code>.</li>
</ul>

mergeKLists

Merge k Sorted Lists

Merge Two Sorted Lists

merge-two-sorted-lists

合并两个有序链表

Ugly Number II

ugly-number-ii

丑数 II

Smallest Subarrays With Maximum Bitwise OR

smallest-subarrays-with-maximum-bitwise-or

按位或最大的最小子数组长度

Linked List

Divide and Conquer

Heap (Priority Queue)

Merge Sort

给你一个链表数组，每个链表都已经按升序排列。

请你将所有链表合并到一个升序链表中，返回合并后的链表。

&nbsp;

示例 1：

<pre>输入：lists = [[1,4,5],[1,3,4],[2,6]]
输出：[1,1,2,3,4,4,5,6]
解释：链表数组如下：
[
 1-&gt;4-&gt;5,
 1-&gt;3-&gt;4,
 2-&gt;6
]
将它们合并到一个有序链表中得到。
1-&gt;1-&gt;2-&gt;3-&gt;4-&gt;4-&gt;5-&gt;6
</pre>

示例 2：

<pre>输入：lists = []
输出：[]
</pre>

示例 3：

<pre>输入：lists = [[]]
输出：[]
</pre>

&nbsp;

提示：

<ul>
	<li><code>k == lists.length</code></li>
	<li><code>0 &lt;= k &lt;= 10^4</code></li>
	<li><code>0 &lt;= lists[i].length &lt;= 500</code></li>
	<li><code>-10^4 &lt;= lists[i][j] &lt;= 10^4</code></li>
	<li><code>lists[i]</code> 按 升序 排列</li>
	<li><code>lists[i].length</code> 的总和不超过 <code>10^4</code></li>
</ul>