要求:气球数组给出每个气球区间,最少的箭打爆
思路:类似于区间去重叠,打爆就是去重叠的过程,按右端点排序,最小右端点以内至少要打一次
class Solution {
public:
static bool cmp(vector<int> &a,vector<int> &b){
return a[1]<b[1];
}
bool isoverlap(vector<int> &a,vector<int> &b){
return a[1]>=b[0];
}
int findMinArrowShots(vector<vector<int>>& points) {
//从左往右遍历,当前最小右边界内必须打一次
sort(points.begin(),points.end(),cmp);
int n=points.size();
int i=0,num=0;
while(i<n){
int j=i+1;
while(j<n){
if(isoverlap(points[i],points[j])){
++j;
}
else break;
}
i=j;
++num;
}
return num;
}
};