Check if All the Integers in a Range Are Covered LeetCode solution in Java

1
class Solution {
2
  public boolean isCovered(int[][] ranges, int left, int right) {
3
    boolean flag = false;
4
    for (int i = left; i <= right; i++) {
5
      for (int[] arr : ranges) {
6
        if (i >= arr[0] && i <= arr[1]) {
7
          flag = true;
8
          break;
9
        }
10
      }
11
      if (!flag) return false;
12
      flag = false;
13
    }
14

15
    return true;
16
  }
17
}