LeetCode 452. Minimum Number of Arrows to Burst Balloons Sort/Medium

---

1.Description

There are some 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. The start is always smaller than the end.

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 traveling up infinitely.

Given an array points where points[i] = [xstart, xend], return the minimum number of arrows that must be shot to burst all balloons.

2.Example

Input: points = [[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).

3.Solution

按照右边界从小到大排序后，第一箭想要射中尽量多的气球，就取第一个气球的右边界，如果之后的气球的左边界小于第一个球的右边界说明被射爆，就在循环中跳过。然后按这样的思想一直遍历。
一般的重写comparator是使用下列（交换相减的顺序能控制从大到小还是从小到大）：
1.匿名内部类：

2.使用Lambda表达式简化匿名内部类：

3.简化省略lambda：

而这里的有一个特殊测试用例[[-2147483646,-2147483645],[2147483646,2147483647]]因此需要改一下。（相减之后会溢出，结果与期望的相反了）

class Solution {
        public int findMinArrowShots(int[][] points) {
        //边界条件判断
        if (points == null || points.length == 0)
            return 0;
        //按照每个气球的右边界排序
        Arrays.sort(points, (a, b) -> a[1] > b[1] ? 1 : -1);
        //获取排序后第一个气球右边界的位置，我们可以认为是箭射入的位置
        int last = points[0][1];
        //统计箭的数量
        int count = 1;
        for (int i = 1; i < points.length; i++) {
            //如果箭射入的位置小于下标为i这个气球的左边位置，说明这支箭不能
            //击爆下标为i的这个气球，需要再拿出一支箭，并且要更新这支箭射入的
            //位置
            if (last < points[i][0]) {
                last = points[i][1];
                count++;
            }
        }
        return count;
    }
}