436. Find Right Interval**
来源:互联网 发布:关口知宏日本铁道 编辑:程序博客网 时间:2024/05/29 12:44
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.
public int[] findRightInterval(Interval[] intervals) { TreeMap<Integer, Integer> map = new TreeMap<>(); int[] res = new int[intervals.length]; for(int i=0; i<intervals.length;i++){ map.put(intervals[i].start, i); } for(int i=0;i<intervals.length;i++){ Integer key = map.ceilingKey(intervals[i].end); res[i]=key!=null?map.get(key):-1; } return res; }
总结:好聪明,关键在于没有相同的start point。
0 0
- 436. Find Right Interval
- 436. Find Right Interval
- 436. Find Right Interval
- 436. Find Right Interval
- 436. Find Right Interval
- 436. Find Right Interval
- 436. Find Right Interval**
- 436. Find Right Interval
- 436. Find Right Interval
- 436. Find Right Interval
- LeetCode 436. Find Right Interval
- [Leetcode] 436. Find Right Interval
- [leetcode]436. Find Right Interval
- Leetcode 436. Find Right Interval
- LeetCode 436. Find Right Interval
- Leetcode-436. Find Right Interval
- [LeetCode]436. Find Right Interval
- leetcode 436. Find Right Interval
- LA 4992 Jungle Outpost 半平面交 -
- ElasticSearch 菜鸟笔记(二)ElasticSearch 安装
- 如何解决SSDsim 转Financial1,2 出bug的情况
- python之西游记字数统计
- 算法竞赛入门经典习题 第二章
- 436. Find Right Interval**
- listView打开activity
- VMware12中安装Linux minimal版(Red Hat Enterprise Linux)
- How to Install CyanogenMod 13 on Huawei Honor 5X
- 谷歌浏览器进入调试模式的命令
- javascript 正则表达式使用说明详细教程
- PHP 驱动 MongoDB 的方法和技巧
- 偶有所感
- 项目中遇到BUG汇总