点击打开链接
struct Interval {
int start;
int end;
Interval() : start(0), end(0) {}
Interval(int s, int e) : start(s), end(e) {}
};
class Solution {
public:
vector<int> findRightInterval(vector<Interval>& intervals) {
int len = intervals.size();
vector<int> result;
map<int, int> hashMap;
for(int i=0; i<len; i++){//key存start val存index
hashMap[intervals[i].start] = i;
}
for(auto interval: intervals){
auto ite = hashMap.lower_bound(interval.end); //返回第一个>=interval.end的迭代器
if(ite==hashMap.end()){//根本就没有
result.push_back(-1);
}
else{
result.push_back(ite->second);
}
}
return result;
}
};