给定一个各区间起点唯一且不重复的区间数组，找到每个区间的右区间，即满足条件startj >= endi的startj最小的区间，并返回其在原数组的索引。若不存在右区间，则返回-1。解决方案涉及到二分查找和映射原索引的技术。
You are given an array of intervals, where intervals[i] = [starti, endi] and each starti is unique.
The right interval for an interval i is an interval j such that startj >= endi and startj is minimized.
Return an array of right interval indices for each interval i. If no right interval exists for interval i, then put -1 at index i.
Example 1:
Input: intervals = [[1,2]] Output: [-1] Explanation: There is only one interval in the collection, so it outputs -1.
Example 2:
Input: intervals = [[3,4],[2,3],[1,2]] Output:
最低0.47元/天 解锁文章
扫一扫
327
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
