Leetcode 452. Minimum Number of Arrows to Burst Balloons

難易度

Medium

アプローチ

Brute-force

class Solution {
    public int findMinArrowShots(int[][] points) {
        Arrays.sort(points, (a, b) -> Integer.compare(a[1],b[1]));

        int result = 1;
        int prev = 0;

        for(int curr = 1 ; curr < points.length; curr++){
            if(points[curr][0] > points[prev][1]){
                result++;
                prev = curr;
            }
        }
        return result;
    }
}

• こちらの解説を参照しました