Leetcode452 用最少数量的箭引爆气球
1.题目描述
2.解题思路
和Leetcode435类似,435是求无重叠区间,452是求重叠区间,所以思路上可以用一样的思路,先排序,之后利用贪心算法求解
3.算法流程
1.排序
2.设定可一次性引爆个数和右边界
3.当下一个气球的左边界小于等于这个气球的右边界时,则视为可以一次引爆
4.更新到下一个还没被引爆的气球处
5.循环,直到所有气球被引爆
4.算法思路
sort(points)
count = 0
i = 0
while i < points.size():
count++
overd = i
end = points[i][0]
while(overd<points.size()&&points[overd][0]<=end)
overd++
i = overd
return count
5.代码
class Solution {
public:
static bool cmp(const vector<int>& a, const vector<int>& b){
return a[1]<b[1];
}
int findMinArrowShots(vector<vector<int>>& points) {
int count = 0;
if(points.size()==1){
return 1;
}
sort(points.begin(),points.end(),cmp);
int i = 0;
while(i<points.size()){
count++;
int overd = i;
int end = points[i][1];
while(overd<points.size()&&points[overd][0]<=end){
overd = overd + 1;
}
i = overd;
}
return count;
}
};