AlgoDesign

Interval covering

1import math
2class Solution:
3    def minimumIntervalCovering(self, intervals):
4        intervals.sort(key=lambda x: x[1])
5        prevEnd, res = -math.inf, 0
6        for i in range(len(intervals)):
7            if intervals[i][0] > prevEnd:
8                prevEnd = intervals[i][1]
9                res += 1
10        return res