-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcheck_if_all_the_integers_in_a_range_are_covered.py
48 lines (34 loc) · 1.56 KB
/
check_if_all_the_integers_in_a_range_are_covered.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
# You are given a 2D integer array ranges and two integers left and right. Each ranges[i] = [starti, endi] represents an inclusive interval
# between starti and endi.
# Return true if each integer in the inclusive range [left, right] is covered by at least one interval in ranges. Return false otherwise.
# An integer x is covered by an interval ranges[i] = [starti, endi] if starti <= x <= endi.
# Example 1:
# Input: ranges = [[1,2],[3,4],[5,6]], left = 2, right = 5
# Output: true
# Explanation: Every integer between 2 and 5 is covered:
# - 2 is covered by the first range.
# - 3 and 4 are covered by the second range.
# - 5 is covered by the third range.
# Example 2:
# Input: ranges = [[1,10],[10,20]], left = 21, right = 21
# Output: false
# Explanation: 21 is not covered by any range.
# Constraints:
# 1 <= ranges.length <= 50
# 1 <= starti <= endi <= 50
# 1 <= left <= right <= 50
class Solution:
def isCovered(self, ranges: List[List[int]], left: int, right: int) -> bool:
# loop throught the range from left and right, inclusively
for i in range(left, right + 1):
# check if the number is between any interval
# put this variable to see if the number is found in any range
in_range = False
for interval in ranges:
# if the number is found, we set the boolean true
if i >= interval[0] and i <= interval[1]:
in_range = True
break
if not in_range:
return False
return True