LeetCode860. 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 do not have any change in hand at first.

Given an integer array bills where billsi is the bill the ith customer pays, return true if you can provide every customer with the correct change, or false otherwise.

Example 1:

Input: bills = 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: bills = 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 not give the change of 15 back because we only have two 10 bills.

Since not every customer received the correct change, the answer is false.

Constraints:

1 <= bills.length <= 105

billsi is either 5, 10, or 20.

二、题解

cpp 复制代码
class Solution {
public:
    bool lemonadeChange(vector<int>& bills) {
        int n = bills.size();
        vector<int> balance(3,0);
        for(int i = 0;i < n;i++){
            int sub = bills[i] - 5;
            if(sub == 5 && balance[0] == 0) return false;
            else if(sub == 15 && (balance[0] == 0 || (balance[1] == 0 && balance[0] < 3))) return false;
            if(sub == 5) balance[0]--;
            else if(sub == 15){
                if(balance[1] > 0) balance[0]--,balance[1]--;
                else balance[0] -= 3;
            }
            if(bills[i] == 5) balance[0]++;
            else if(bills[i] == 10) balance[1]++;
            else balance[2]++;
        }
        return true;
    }
};

更好的解法

cpp 复制代码
class Solution {
public:
    bool lemonadeChange(vector<int>& bills) {
        int n = bills.size();
        int five = 0,ten = 0,twenty = 0;
        for(int i = 0;i < n;i++){
            if(bills[i] == 5) five++;
            else if(bills[i] == 10){
                if(five == 0) return false;
                ten++;
                five--;
            }
            else if(bills[i] == 20){
                if(five > 0 && ten > 0) five--,ten--;
                else if(five >= 3 && ten == 0) five -= 3;
                else return false;
            }
        }
        return true;
    }
};
相关推荐
xuxigifxfh8 分钟前
牛客:HJ170 01序列
java·开发语言·算法·华为机考
朝朝辞暮i19 分钟前
C++ 第 33 课:事件循环——spin() 到底在干什么
开发语言·c++·算法
殷色玫瑰30 分钟前
AVL树:从平衡因子到四种旋转的完整实现
c语言·数据结构·c++·算法·visualstudio
进化中的刀盾兽1 小时前
从零实现 C++ AI 大模型接入 SDK(九):LLMManager 统一模型管理与请求路由
c++
会周易的程序员1 小时前
STVM OSAL 层架构设计文档
c++·物联网·嵌入式·虚拟机·iot·软plc·iec61131
.YM.Z1 小时前
C++——【红黑树】原理详解:定义、性质、插入变色与旋转实现
开发语言·c++
jidaowansui1 小时前
B3643 图的存储———>数组模拟邻接矩阵
算法
y1su2 小时前
Leetcode 二分模板
java·数据结构·算法·leetcode·排序算法
bksczm2 小时前
数据结构的大纲概括
数据结构
youshi66682 小时前
平衡车——PID算法优化
stm32·单片机·嵌入式硬件·算法·pid·平衡车