Check if All the Integers in a Range Are Covered

给一个ranges的数组, 求[left, right]之间的数字是否都能被ranges数组覆盖.

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