Open Tcdian opened 3 years ago
/**
* @param {number[][]} intervals
* @return {number[]}
*/
var findRightInterval = function(intervals) {
const result = new Array(intervals.length);
const sortedIntervals = intervals
.map((interval, index) => [interval, index])
.sort(([[a]], [[b]]) => a - b);
sortedIntervals.forEach(([[start, end], index]) => {
const minRightInterval = sortedIntervals.find((interval) => {
return interval[0][0] >= end;
});
if (minRightInterval === undefined) {
result[index] = -1;
} else {
result[index] = minRightInterval[1];
}
});
return result;
};
function findRightInterval(intervals: number[][]): number[] {
const result: number[] = new Array(intervals.length);
const sortedIntervals = intervals
.map((interval, index) => [interval, index] as const)
.sort(([[a]], [[b]]) => a - b);
sortedIntervals.forEach(([[start, end], index]) => {
const minRightInterval = sortedIntervals.find((interval) => {
return interval[0][0] >= end;
});
if (minRightInterval === undefined) {
result[index] = -1;
} else {
result[index] = minRightInterval[1];
}
});
return result;
};
436. Find Right Interval
给定一组区间,对于每一个区间
i
,检查是否存在一个区间j
,它的起始点大于或等于区间i
的终点,这可以称为j
在i
的“右侧”。对于任何区间,你需要存储的满足条件的区间
j
的最小索引,这意味着区间j
有最小的起始点可以使其成为“右侧”区间。如果区间j
不存在,则将区间i
存储为-1
。最后,你需要输出一个值为存储的区间值的数组。Note
Example 1
Example 2
Example 3