[LeetCode] Smallest Range Covering Elements from K Lists

632. Smallest Range Covering Elements from K Lists 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. ...

Submit