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 bills[i] 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

bills[i] 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;
    }
};
相关推荐
千逐-沐风几秒前
SMU-ACM2026冬训周报3rd
算法
wangjialelele8 分钟前
Linux下的IO操作以及ext系列文件系统
linux·运维·服务器·c语言·c++·个人开发
老赵说12 分钟前
Java基础数据结构全面解析与实战指南:从小白到高手的通关秘籍
数据结构
打工哪有不疯的20 分钟前
使用 MSYS2 为 Qt (MinGW 32/64位) 完美配置 OpenSSL
c++·qt
铉铉这波能秀22 分钟前
LeetCode Hot100数据结构背景知识之元组(Tuple)Python2026新版
数据结构·python·算法·leetcode·元组·tuple
晚霞的不甘28 分钟前
Flutter for OpenHarmony 实现计算几何:Graham Scan 凸包算法的可视化演示
人工智能·算法·flutter·架构·开源·音视频
代码游侠34 分钟前
C语言核心概念复习——C语言基础阶段
linux·开发语言·c++·学习
㓗冽43 分钟前
60题之内难题分析
开发语言·c++·算法
大江东去浪淘尽千古风流人物44 分钟前
【VLN】VLN仿真与训练三要素 Dataset,Simulators,Benchmarks(2)
深度学习·算法·机器人·概率论·slam
rainbow68891 小时前
C++开源库dxflib解析DXF文件实战
开发语言·c++·开源