Method dfs

java/1235-maximum-profit-in-job-scheduling.java:19–36

(int i)

    }

    private int dfs(int i) {
        if (i == intervals.length) {
            return 0;
        }

        if (cache[i] != null) {
            return cache[i];
        }

        // don't include
        int res = dfs(i + 1);

        // include
        int j = binarySearch(intervals, i, intervals[i][1]);
        cache[i] = res = Math.max(res, intervals[i][2] + dfs(j));

        return res;
    }

    private int binarySearch(int[][] intervals, int start, int target) {
        int left = start + 1;