436. Find Right Interval

Link

Solution

By treeMap

   public int[] findRightInterval(int[][] intervals) {
        int[] ans = new int[intervals.length];
        TreeMap<Integer, Integer> map = new TreeMap<>();
        for(int i = 0; i < intervals.length; i++){
            map.put(intervals[i][0], i);
        }
        
        for(int i = 0; i < intervals.length; i++){
            Integer result = map.ceilingKey(intervals[i][1]);
            ans[i] = result == null ? -1 : map.get(result);
        }
        return ans;
    }