Leetcode-436. Find Right Interval

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。

博客链接：mcf171的博客

——————————————————————————————

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:

1. You may assume the interval's end point is always bigger than its start point.
2. 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.

这个题目可以先用List<int[]>保存所有的区间，然后用Collections.sort根据start来升序排序，接下来就是再次遍历所有区间，通过二分的方式来找他的下一个区间。时间复杂度O(nlgn)，空间复杂度O(n)。 Your runtime beats 92.42% of java submissions.

public class Solution {
    public int[] findRightInterval(Interval[] intervals) {
        List<int[]> datas = new ArrayList<int[]>();
        for(int i = 0 ; i < intervals.length; i ++){
            datas.add(new int[]{intervals[i].start,i});
        }
        Collections.sort(datas, new Comparator<int[]>(){
            @Override
            public int compare(int[]a, int[]b){
                if(a[0] - b[0] == 0) return 0;
                if(a[0] - b[0] > 0) return 1;
                else return -1;
            }
        });
        int[][] stores = datas.toArray(new int[datas.size()][2]);
        int[] results = new int[intervals.length];
        for(int i = 0 ; i < intervals.length; i ++){
            Interval item = intervals[i];
            results[i] = help(stores,item.end);
        }
        return results;
    }
    private int help(int[][]stores, int end){
        int l = 0, r = stores.length, mid = (l + r)/2;
        while(l<r){
            if(stores[mid][0] == end) return stores[mid][1];
            if(stores[mid][0] > end) r = mid;
            else l = mid + 1;
            mid = (l+r)/2;
        }
        if(l == 0 || r == stores.length) return -1;
        else if(stores[l][0] > end) return stores[l][1];
        else return stores[r][1];
    }
}