Minimum Number of Arrows to Burst Balloons

题目

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).

分析

这是leetcode中的一道贪心算法题，二维平面上有若干气球，从x轴的任一点发射箭头，箭头所碰到的气球都会被刺破，且箭头刺破气球后依然按原方向继续运动。题目是求解所需要发射的最小箭头数，使得所有气球都被刺破。

很容易想到的是每只箭都必须尽可能刺破更多的气球。从这一点出发，将平面上的气球排序，终点靠右的排在后面， 终点相同时，起点靠右的排在后面。

1. 排好序后的第一个气球设置为当前气球，所需箭数赋值为1

2. 将箭的发射起点定在当前气球的终点位置

3. 该箭射出后，当前祈求设置为数组中第一个为被刺破的气球

4.同时所需箭的数量加1

5. 返回步骤2知道所有气球被刺破。

算法复杂度为O（n^2），优化排序算法后理应可以达到O（nlogn）

代码

bool operator<(const pair<int,int>& a,const pair<int,int>& b)
{
	return a.second < b.second || (a.second == b.second && a.first < b.first);
}

class Solution {
public:
    int findMinArrowShots(vector<pair<int, int> >& points) {
    	if (points.empty()) return 0;
        vector<pair<int,int> > copy = points;
        int n = copy.size();
        for (int i = 1;i < n;i++)
        {
        	int j;
        	pair<int,int> tmp = copy[i];
        	for (j = i - 1;tmp < copy[j] && j >= 0;j--)
        		copy[j+1] = copy[j];
        	copy[j+1] = tmp;
		}
		int ans = 1,x = copy[0].second;
		for (int i = 1;i < n;i++)
			if (copy[i].first > x)
			{
				x = copy[i].second;
				ans++;
			}
		return ans;
    }
};