[leetcode]Minimum Number of Arrows to Burst Balloons
链接:https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/
Question
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 xendbursts 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).
Solution
// 思路:想要尽可能的打落所有的气球,做法是现将所有气球按照end从小到大进行排序,尽可能打得越右越好,因为这样的话可以尽可能打得越多的气球
// 另:一定要注意对于特殊值进行判断..
class Solution {
public:
struct compare {
bool operator()(const pair<int, int> left, const pair<int, int> right) {
return left.second < right.second || (left.second == right.second && left.first < right.first);
}
};
int findMinArrowShots(vector<pair<int, int>>& points) {
if (points.size() == 0) return 0;
sort(points.begin(), points.end(), compare());
int end = points[0].second;
int cnt = 1;
for (int i = 1; i < points.size(); i++) {
if (points[i].first <= end && end <= points[i].second) {
continue;
} else {
end = points[i].second;
cnt++;
}
}
return cnt;
}
};
思路:具体看注释~