程式語言 - LeetCode - C++ - 452. Minimum Number of Arrows to Burst Balloons



題目:


解答:

class Solution {
public:
    int findMinArrowShots(vector<vector<int>>& points) {
        sort(points.begin(), points.end());

        int r = points.size();
        int last = 0;

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

        return r;
    }
};