class Solution {
public:
static bool compare( const vector<int>& v1, const vector<int>& v2){ //一定记得加static
return v1[1]<v2[1];
}
int eraseOverlapIntervals(vector<vector<int>>& intervals) {
if(intervals.size()==0) return 0;
sort(intervals.begin(), intervals.end(), compare);
int count=1; //至少有一个是满足要求的
int end_time=intervals[0][1];
for(auto event: intervals){
if(event[0]>=end_time){
count++;
end_time=event[1];
}
}
return intervals.size()-count;
}
};
Leetcode 435. Non-overlapping Intervals关于贪心算法,区间调度,sort函数比较函数的写法
最新推荐文章于 2021-09-21 13:45:30 发布