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:

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.

/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */
public class Solution {
    public int[] findRightInterval(Interval[] intervals) {
        Map<Integer,Integer> map = new HashMap<Integer,Integer>();
        ArrayList<Integer> startslist = new ArrayList<Integer>();
        int len = intervals.length;
        //add all start value into startslist and remember the original start value&index into map.
        for(int i=0;i<len;i++){
            map.put(intervals[i].start,i);
            startslist.add(intervals[i].start);
        }
        
        Collections.sort(startslist);
        int[] ans = new int[len];//because the final answer's size is corresponding to the original array
        for(int i=0;i<len;i++){
            int end = intervals[i].end;
            int start = binarysearch(startslist,end);
            if(start<end) ans[i]=-1;
            else ans[i] = map.get(start);
        }
        return ans;
    }
    
    public int binarysearch(ArrayList<Integer> list,int x){
        int left = 0;
        int right = list.size()-1;
        while(left<right){
            int mid = left+(right-left)/2;
            if(list.get(mid)<x) left=mid+1;
            else right=mid;//attention use "else"
        }
        return list.get(left);
    }
}