LeetCode436:寻找右侧区间

class Solution {
    public int[] findRightInterval(int[][] intervals) {
        int n = intervals.length;
        int[] result = new int[n];
        int[][] starts = new int[n][2];
        for (int i = 0; i             starts[i][0] = intervals[i][0];
            starts[i][1] = i;
        }
        Arrays.sort(starts, (a, b) -> a[0] - b[0]);
        for (int i = 0; i             result[i] = binarySearch(starts, intervals[i][1]);
        }
        return result;
    }
    private int binarySearch(int[][] starts, int target) {
        int left = 0, right = starts.length - 1, answer = -1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (starts[mid][0] >= target) {
                answer = starts[mid][1];
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }
        return answer;
    }
}