贪心算法day11（用最少数量的箭引爆气球）

1.用最少数量的箭引爆气球

452. 用最少数量的箭引爆气球 - 力扣（LeetCode）

 例子：points = {{1,5}，{1,2}，{4,5}}可以覆盖基本状况

class Solution {public int findMinArrowShots(int[][] points) {Arrays.sort( points, (v1,v2) ->   { return v1[0] > v2[0]?1:-1;});int right = points[0][1],count = 1; for(int i = 1 ; i < points.length ; i ++){int a = points[i][0], b = points[i][1];if(a > right ){count++;right = b;}else{right = Math.min(right,b);}}return count;}
}