贪心算法 力扣452

贪心算法（）力扣452与435类似
c++

按边界排序后，不断比较

代码如下

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) {
    sort(points.begin(),points.end(),cmp);
    int count = 1;
    int start = points[0][1];
    for(int i = 1;i<points.size();i++){
        if(start<points[i][0])
        {
            count++;
            start = points[i][1];
        }
        
    }
    return count;

}

};