区间贪心算法--用最少数量的箭引爆气球

题目链接： 

力扣

package com.javase.leetcode;

import java.util.Arrays;
import java.util.Comparator;

public class Leetcode_452 {

    public static int findMinArrowShots(int[][] points) {

//        System.out.println(Arrays.toString(points[0]));
//        System.out.println(Arrays.toString(points[1]));
//        System.out.println(Arrays.toString(points[2]));
//        System.out.println(Arrays.toString(points[3]));

//        System.out.println(Arrays.toString(points));

        //方式一： 对二维数组的第一个元素排序
//        Arrays.sort(points,new Comparator<int[]>(){
//            @Override
//            public int compare(int[] a,int[] b){
//                //其中a[0]-b[0]表示对于第二个元素经行升序,排序如果为b[0]-b[0]则表示为降序
//                return a[0]-b[0];
//            }
//        });

        //方式二： 对二维数组的第一个元素排序
//        Arrays.sort(points,(a,b) -> a[0]-b[0]); //这种排序方式会有数据溢出的风险
        Arrays.sort(points,(a,b) -> a[0]>b[0] ? 1 : -1);

        int arrowCount = 1;
        int curArrowLeft = points[0][0], curArrowRight = points[0][1];

        for (int i = 1; i < points.length; i++) {
            if(points[i][0]<= curArrowRight){
                if(points[i][1]<curArrowRight){
                    curArrowRight = points[i][1];
                }
            }else{
                arrowCount++;
                curArrowLeft = points[i][0];
                curArrowRight = points[i][1];
            }
        }

//        System.out.println(Arrays.toString(points[0]));
//        System.out.println(Arrays.toString(points[1]));
//        System.out.println(Arrays.toString(points[2]));
//        System.out.println(Arrays.toString(points[3]));

//        System.out.println(Arrays.toString(points));
        return arrowCount;
    }

    public static void main(String[] args) {
//[10,16],[2,8],[1,6],[7,12]
//        int[][] points = {{10,16},{2,8},{1,6},{7,12}};
        System.out.println(Integer.MAX_VALUE);
        System.out.println(Integer.MIN_VALUE);
        int[][] points = {{-2147483646,-2147483645},{2147483646,2147483647}};
        System.out.println(findMinArrowShots(points));
    }
}