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

1
class Solution {
2
 public:
3
  bool isCovered(vector<vector<int>> &ranges, int left, int right) {
4
    int n = ranges.size();
5

6
    sort(ranges.begin(), ranges.end());
7

8
    if (left < ranges[0][0]) // BASE CASE
9
      return false;
10

11
    bool ans = false;
12

13
    for (int i = 0; i < n; i++) {
14
      if (left >= ranges[i][0] && left <= ranges[i][1]) {
15
        left = ranges[i][1] + 1;
16
      }
17
      if (left > right) {
18
        ans = true;
19
        break;
20
      }
21
    }
22
    return ans;
23
  }
24
};