452. Minimum Number of Arrows to Burst Balloons

题目：

452. Minimum Number of Arrows to Burst Balloons

Add to List

Description Hints Submissions Solutions

• Total Accepted: 9905
• Total Submissions: 22906
• Difficulty: Medium
• Contributors:abhijeeg

There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordinates don't matter and hence the x-coordinates of start and end of the diameter suffice. Start is always smaller than end. There will be at most 104 balloons.

An arrow can be shot up exactly vertically from different points along the x-axis. A balloon with xstart and xend bursts by an arrow shot at x if xstart ≤ x ≤ xend. There is no limit to the number of arrows that can be shot. An arrow once shot keeps travelling up infinitely. The problem is to find the minimum number of arrows that must be shot to burst all balloons.

Example:

Input:
[[10,16], [2,8], [1,6], [7,12]]

Output:
2

Explanation:
One way is to shoot one arrow for example at x = 6 (bursting the balloons [2,8] and [1,6]) and another arrow at x = 11 (bursting the other two balloons).

解题思路：

这题和上课讲的开会的例子有一点相似，都是给出了一个时间的起始点和终止点，只不过开会的例子是要求出不重叠的，但这道题要求重叠最多的。因此可以模仿开会的例子的解题方法，先按照终止点从小到大排序（如果终止点相同则比较起始点），然后先在排序后的在一个气球终止点射一支箭，对于剩余的所有气球，如果起始点不在上一支箭的位置之后（即上一支箭已经将这个气球射破），则跳过这个气球；否则在这个气球的终止点再射一支箭，箭的总数加一。

代码：

class Solution {
public:
    int findMinArrowShots(vector<pair<int, int>>& points) {
        if(points.size() == 0)
            return 0;
        sort(points.begin(), points.end(), comp);
        int count = 1;
        int arrow = points[0].second;
        for(int i = 1; i < points.size(); i ++){
            if(points[i].first <= arrow)
                continue;
            else{
                count ++;
                arrow = points[i].second;
            }
        }
        return count;
    }

    static bool comp(pair<int, int>& a, pair<int, int>& b){
        return a.second == b.second ? a.first < b.first : a.second < b.second;
    }
};