【LeetCode】452. 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).

题解：

先对ballon进行排序，按照second升序，如果second相等则按照first升序排列。对于排列之后的vector，第一次射击数字为points[0]的first和second之间的，如果points[i].first<=points[o].second，那这一次射击可以射到points[i]，反之射击不到，将射击数字更新为points[i].second，再重复判断。记录更新的次数，就是索求答案。

答案：

class Solution {
public:
        static bool newsort(pair<int,int>a,pair<int,int> b)
{
if(a.second<b.second)
return 1;
else if(a.second==b.second)
{
if(a.first<b.first)
return 1;
else
return 0;
}
else
return 0;
}




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

}
return count;
    }
};

优化后的

class Solution {
public:
        int findMinArrowShots(vector<pair<int, int>>& points) {
        int count = 0, arrow = INT_MIN;
        sort(points.begin(), points.end(), mysort);
        for(int i = 0; i<points.size(); i++){
            if(arrow!=INT_MIN && points[i].first<=arrow){continue;} //former arrow shot points[i] 
            arrow = points[i].second; // new arrow shot the end of points[i]
            count++;
        }
        return count;
    }
    static bool mysort(pair<int, int>& a, pair<int, int>& b){
        return a.second==b.second?a.first<b.first:a.second<b.second;
    }
};