leetcode 452. 用最少数量的箭引爆气球

需要排序将相邻的气球排在一块

 

class Solution {
public:

    static bool cmp(const vector<int> &a, const vector<int> &b)
    {
        return a[0] < b[0];
    }

    int findMinArrowShots(vector<vector<int>>& points) {

        if(points.empty())
            return 0;
        sort(points.begin(), points.end());
        int res = 1;

        for(int i = 1; i < points.size(); i++)
        {
            if(points[ i - 1][1] < points[i][0])
                res++;
            else
                points[i][1] = min(points[i -1 ][1], points[i][1]);
        }

        return res;

    }
};