代码随想三刷贪心篇3

134. 加油站

题目

链接

代码

class Solution {
    public int canCompleteCircuit(int[] gas, int[] cost) {
        int curSum = 0;
        int totalSum = 0;
        int index = 0;
        for(int i =0;i<gas.length;i++){
            curSum += gas[i]-cost[i];
            totalSum += gas[i]-cost[i];
            if(curSum<0){
                index = (i+1)%gas.length;
                curSum =0;
            }
        }
        if(totalSum<0){
            return -1;
        }
        return index;
    }
}

135. 分发糖果

题目

链接

代码

class Solution {
    public int candy(int[] ratings) {
        int n = ratings.length;
        int[] candyArr= new int[n];
        candyArr[0] = 1;
        for (int i = 1; i < n; i++) {
            candyArr[i] = (ratings[i] > ratings[i - 1]) ? candyArr[i - 1] + 1 : 1;
        }

        for (int i = n - 2; i >= 0; i--) {
            if (ratings[i] > ratings[i + 1]) {
                candyArr[i] = Math.max(candyArr[i], candyArr[i + 1] + 1);
            }
        }
        int ans = 0;
        for (int num : candyArr) {
            ans += num;
        }
        return ans;
    }
}

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){
                if(five<=0){
                    return false;
                }
                five--;
                ten++;
            }else if(bills[i]==20){
                if(ten>0&&five>0){
                    ten--;
                    five--;
                }else if(ten==0&&five>=3){
                    five-=3;
                }else{
                    return false;
                }
            }

        }
        return true;
    }
}

406. 根据身高重建队列

题目

链接

代码

public int[][] reconstructQueue(int[][] people) {
        Arrays.sort(people, (a, b) -> {
            if (a[0] == b[0]) return a[1] - b[1];   
            return b[0] - a[0];   
        });
        LinkedList<int[]> que = new LinkedList<>();

        for (int[] p : people) {
            que.add(p[1],p);   
        }
        return que.toArray(new int[people.length][]);
    }