Method binarySearch

java/1235-maximum-profit-in-job-scheduling.java:38–53

(int[][] intervals, int start, int target)

    }

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

        while (left <= right) {
            int mid = left + (right - left) / 2;

            if (intervals[mid][0] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }

        return left;
    }
}