1893. 检查是否区域内所有整数都被覆盖

class Solution {
     public boolean isCovered(int[][] ranges, int left, int right) {
        for (int i = left; i <= right; i++) {
            boolean ok = false;
            for (int[] range : ranges) {
                int a = range[0], b = range[1];
                if (a <= i && i <= b) {
                    ok = true;
                    break;
                }
            }
            if (!ok) {
                return false;
            }
        }
        return true;
    }
}