【LeetCode】860. Lemonade Change 柠檬水找零（Easy）（JAVA）每日一题

【LeetCode】860. Lemonade Change 柠檬水找零（Easy）（JAVA）

题目地址: https://leetcode.com/problems/lemonade-change/

题目描述：

At a lemonade stand, each lemonade costs $5.

Customers are standing in a queue to buy from you, and order one at a time (in the order specified by bills).

Each customer will only buy one lemonade and pay with either a $5, $10, or $20 bill.  You must provide the correct change to each customer, so that the net transaction is that the customer pays $5.

Note that you don’t have any change in hand at first.

Return true if and only if you can provide every customer with correct change.

Example 1:

Input: [5,5,5,10,20]
Output: true
Explanation: 
From the first 3 customers, we collect three $5 bills in order.
From the fourth customer, we collect a $10 bill and give back a $5.
From the fifth customer, we give a $10 bill and a $5 bill.
Since all customers got correct change, we output true.

Example 2:

Input: [5,5,10]
Output: true

Example 3:

Input: [10,10]
Output: false

Example 4:

Input: [5,5,10,10,20]
Output: false
Explanation: 
From the first two customers in order, we collect two $5 bills.
For the next two customers in order, we collect a $10 bill and give back a $5 bill.
For the last customer, we can't give change of $15 back because we only have two $10 bills.
Since not every customer received correct change, the answer is false.

Note:

• 0 <= bills.length <= 10000
• bills[i] will be either 5, 10, or 20.

题目大意

在柠檬水摊上，每一杯柠檬水的售价为 5 美元。

顾客排队购买你的产品，（按账单 bills 支付的顺序）一次购买一杯。

每位顾客只买一杯柠檬水，然后向你付 5 美元、10 美元或 20 美元。你必须给每个顾客正确找零，也就是说净交易是每位顾客向你支付 5 美元。

注意，一开始你手头没有任何零钱。

如果你能给每位顾客正确找零，返回 true ，否则返回 false 。

解题方法

1. 遇到 5 块钱，把 5 块钱存起来
2. 遇到 10 块钱，判断是否有 5 块，有的话，5 块的个数减 -1，10 块的个数 +1；否则，直接返回 false
3. 遇到 20 块钱，判断是否有 10 块，有的话，在判断是否有 5 块，有的话 10 块 -1，5 块 -1， 否则直接返回 false；如果没有 10 块，判断 5 块是否大于等于 3 个，大于等于的话，5 块个数 -3，否则返回 false

class Solution {
    public boolean lemonadeChange(int[] bills) {
        int[] cash = new int[2];
        for (int i = 0; i < bills.length; i++) {
            if (bills[i] == 5) {
                cash[0]++;
            } else if (bills[i] == 10) {
                cash[0]--;
                cash[1]++;
            } else if (bills[i] == 20) {
                if (cash[1] == 0) {
                    cash[0] -= 3;
                } else {
                    cash[1]--;
                    cash[0]--;
                }
            }
            if (cash[0] < 0) return false;
        }
        return true;
    }
}

执行耗时:3 ms,击败了22.88% 的Java用户
内存消耗:39.3 MB,击败了86.27% 的Java用户

欢迎关注我的公众号，LeetCode 每日一题更新