leetcode题解-436. Find Right Interval

题目：

Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal to the end point of the interval i, which can be called that j is on the "right" of i.

For any interval i, you need to store the minimum interval j's index, which means that the interval j has the minimum start point to build the "right" relationship for interval i. If the interval j doesn't exist, store -1 for the interval i. Finally, you need output the stored value of each interval as an array.

Note:
You may assume the interval's end point is always bigger than its start point.
You may assume none of these intervals have the same start point.
Example 1:
Input: [ [1,2] ]

Output: [-1]

Explanation: There is only one interval in the collection, so it outputs -1.
Example 2:
Input: [ [3,4], [2,3], [1,2] ]

Output: [-1, 0, 1]

Explanation: There is no satisfied "right" interval for [3,4].
For [2,3], the interval [3,4] has minimum-"right" start point;
For [1,2], the interval [2,3] has minimum-"right" start point.
Example 3:
Input: [ [1,4], [2,3], [3,4] ]

Output: [-1, 2, -1]

Explanation: There is no satisfied "right" interval for [1,4] and [3,4].
For [2,3], the interval [3,4] has minimum-"right" start point.

本题是要寻找一个间隔开始比另一个间隔结束还要大的“右间隔”。思考之后我们应该会想到把所有间隔的开始数字保存到一个数组里面并排序，然后在对每一个间隔的结束数字对该数组进行二叉搜索即可， 但是有一点我们需要注意的是，本题要求我们返回最小“右间隔”的索引位置，所以我们应该使用一个HashMap来保存数组每个数组对应的索引，避免排序之后导致索引出错。代码比较简单如下：

 public static int[] findRightInterval(Interval[] intervals) {
        int [] starts = new int[intervals.length];
        int [] ends = new int[intervals.length];
        HashMap<Integer, Integer> start = new HashMap<>();
        for(int i=0; i<intervals.length; i++){
            starts[i] = intervals[i].start;
            ends[i] = intervals[i].end;
            start.put(intervals[i].start, i);
        }

        Arrays.sort(starts);

        int [] res = new int[intervals.length];

        for(int i=0; i<intervals.length; i++){
            int target = ends[i];
            if(target > starts[intervals.length-1]) {
                res[i] = -1;
                continue;
            }
            int left=0, right=intervals.length-1, mid;
            boolean flag = false;
            while(left <= right){
                mid = (left+right)/2;
                if(starts[mid] == target) {
                    res[i] = start.get(target);
                    flag = true;
                    break;
                }
                else if(starts[mid] > target)
                    right = mid - 1;
                else
                    left = mid + 1;
            }
            if(!flag)
                res[i] = start.get(starts[left]);
        }
        return res;
    }

以上。