[LeetCode]452. Minimum Number of Arrows to Burst Balloons

https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/?tab=Description

给定圆形气球的直径起点和终点坐标，求最少多少次射箭将所有气球刺穿

按照直径的end坐标排序！！！看当前end能覆盖多少个beg

public class Solution {
    public int findMinArrowShots(int[][] points) {
        Arrays.sort(points, new Comparator<int[]>() {
            public int compare(int[] p1, int[] p2) {
                return p1[1] == p2[1] ? p1[0] - p2[0] : p1[1] - p2[1];
            }
        });
        int res = 0;
        int i = 0;
        while (i < points.length) {
            int index = points[i][1];
            while (i < points.length && points[i][0] <= index) {
                i++;
            }
            res++;
        }
        return res;
    }
}