leetcode 452 贪心算法

class Solution {
    public int findMinArrowShots(int[][] points) {
        int l = points.length;
        if(l==0) return 0;
        Arrays.sort(points,new Comparator<int[]>(){
            @Override
            public int compare(int[] o1, int[] o2){
                if(o1[0]==o2[0]){
                    if(o1[1]>o2[1])return 1;
                }
                else if(o1[0]>o2[0])return 1;
                return -1;
            }
        });
        int cnt = 1, ans=1, r = points[0][1];
        for(int i=1;i<l;i++){
            if(points[i][0]>r){
                cnt++;
                r = points[i][1];
            }
            else{
                r = points[i][1]<r?points[i][1]:r;
            }
        }
        return cnt;
    }
}