题目
我的题解
class Solution {
public boolean isCovered(int[][] ranges, int left, int right) {
int[] numFre = new int[51];
for (int i = left; i <= right; i++) {
numFre[i] = 1;
}
for (int[] r : ranges) {
for (int i = r[0]; i <= r[1]; i++) {
numFre[i]--;
}
}
for (int j : numFre) {
if (j == 1) {
return false;
}
}
return true;
}
}