mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
34 lines
1.3 KiB
HTML
34 lines
1.3 KiB
HTML
<p>You have <code>k</code> lists of sorted integers in <strong>non-decreasing order</strong>. Find the <b>smallest</b> range that includes at least one number from each of the <code>k</code> lists.</p>
|
|
|
|
<p>We define the range <code>[a, b]</code> is smaller than range <code>[c, d]</code> if <code>b - a < d - c</code> <strong>or</strong> <code>a < c</code> if <code>b - a == d - c</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [[4,10,15,24,26],[0,9,12,20],[5,18,22,30]]
|
|
<strong>Output:</strong> [20,24]
|
|
<strong>Explanation: </strong>
|
|
List 1: [4, 10, 15, 24,26], 24 is in range [20,24].
|
|
List 2: [0, 9, 12, 20], 20 is in range [20,24].
|
|
List 3: [5, 18, 22, 30], 22 is in range [20,24].
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [[1,2,3],[1,2,3],[1,2,3]]
|
|
<strong>Output:</strong> [1,1]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>nums.length == k</code></li>
|
|
<li><code>1 <= k <= 3500</code></li>
|
|
<li><code>1 <= nums[i].length <= 50</code></li>
|
|
<li><code>-10<sup>5</sup> <= nums[i][j] <= 10<sup>5</sup></code></li>
|
|
<li><code>nums[i]</code> is sorted in <strong>non-decreasing</strong> order.</li>
|
|
</ul>
|