Package g0601_0700.s0632_smallest_range_covering_elements_from_k_lists

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    632 - Smallest Range Covering Elements from K Lists.

    Hard

    You have k lists of sorted integers in non-decreasing order. Find the smallest range that includes at least one number from each of the k lists.

    We define the range [a, b] is smaller than range [c, d] if b - a < d - c or a < c if b - a == d - c.

    Example 1:

    Input: nums = [4,10,15,24,26,0,9,12,20,5,18,22,30]

    Output: 20,24

    Explanation:

    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.

    Example 2:

    Input: nums = [1,2,3,1,2,3,1,2,3]

    Output: 1,1

    Constraints:

    • nums.length == k

    • 1 <= k <= 3500

    • 1 <= nums[i].length <= 50

    • <code>-10<sup>5</sup><= numsj<= 10<sup>5</sup></code>

    • nums[i] is sorted in non-decreasing order.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final IntArray smallestRange(List<List<Integer>> nums)

      • Methods inherited from class java.lang.Object

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