代码随想录算法训练营第三十五天

860. 柠檬水找零

class Solution {
    public boolean lemonadeChange(int[] bills) {

        int five = 0;
        int ten = 0;

        for(int i = 0 ;i < bills.length ; i++){
            if(bills[i] == 5){
                five++;
            }else if (bills[i] == 10){
                ten++;
                five--;
            }else if (bills[i] == 20){
                if(ten > 0){
                    ten--;
                    five--;
                }else {
                    five = five - 3;
                }
            }

            if(five < 0 || ten < 0){
                return false;
            }
        }

        return true;

    }
}

406. 根据身高重建队列

class Solution {
    public int[][] reconstructQueue(int[][] people) {

        Arrays.sort(people,(a,b) -> {
            if (a[0] == b[0]) {
                return a[1] - b[1];
            }else {
                return b[0] - a[0];
            }
        });


        LinkedList<int[]> ques = new LinkedList();

        for(int[] p : people){
            ques.add(p[1],p);
        }

        return ques.toArray(new int[people.length][]);

    }
}

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

class Solution {
    public int findMinArrowShots(int[][] points) {

        Arrays.sort(points,(a,b) -> Integer.compare(a[0],b[0]));

        int count = 1;

        for(int i = 1 ;i < points.length ;i++){
            if(points[i][0] > points[i-1][1]){
                count++;
            }else {
                points[i][1] = Math.min(points[i][1],points[i-1][1]);
            }
        }

        return count;

    }
}