#435. Non-overlapping Intervals
在这里插入代码片class Solution {
public:
static bool cmp(vector<int>& a, vector<int>& b)
{
return a[1] < b[1];//error: a.end() < b.end()
}
int eraseOverlapIntervals(vector<vector<int>>& intervals)
{
int n = 0;
sort(intervals.begin(), intervals.end(), cmp);
int a = intervals[0][1];
for(int i = 1; i< intervals.size(); i++)
{
if(a <= intervals[i][0]) a = intervals[i][1];
else n++;
}
return n;
}
};