class Solution {
public:
static bool cmp(const vector<int>& x,const vector<int>& y){
if(x[1] < y[1]) return true;
return false;
}
int eraseOverlapIntervals(vector<vector<int>>& intervals) {
sort(intervals.begin(),intervals.end(),cmp);
int ans = 0;
int R = INT_MIN;
for(int i=0;i<intervals.size();i++){
if(intervals[i][0] >= R) R = intervals[i][1];
else ans++;
}
return ans;
}
};
No.98 - LeetCode435 - 重叠区间 - 结束区间贪心
最新推荐文章于 2024-08-01 16:29:11 发布