一、题目
二、代码
class Solution
{
public:
//核心思路:排序后 缩小区间
static bool cmp(const vector<int> & vec1 ,const vector<int> & vec2 )
{
return vec1[0]<vec2[0];
}
int findMinArrowShots(vector<vector<int>>& points)
{
int i;
int return_num=0;
sort(points.begin(),points.end(),cmp);
vector<vector<int>> process_vector(points);
// for(i=0;i<points.size();i++)
// {
// std::cout<<" "<<points[i][0]<<" "<<points[i][1]<<" interval";
// }
// std::cout<<std::endl;
return_num=1;
for(i=1;i<process_vector.size();i++)
{
if(process_vector[i][0]>process_vector[i-1][1])
{
return_num++;
}
else
{
process_vector[i][1]=min(process_vector[i-1][1],process_vector[i][1]);
}
}
return return_num;
}
};