当前位置:网站首页>860. Lemonade change
860. Lemonade change
2022-07-06 16:08:00 【mrbone9】
Address :
Power button https://leetcode-cn.com/problems/lemonade-change/
subject :
On the lemonade stand , The price of each lemonade is 5 dollar . Customers line up to buy your products ,( By bill bills The order of payment ) Buy one cup at a time .
Each customer only buys a glass of lemonade , Then pay you 5 dollar 、10 US dollars or 20 dollar . You have to give every customer the right change , That is to say, the net transaction is that every customer pays you 5 dollar .
Be careful , You didn't have any change at first .
Give you an array of integers bills , among bills[i] It's No i A customer paid the bill . If you can give every customer the right change , return true , Otherwise return to false .
Example 1:
Input :bills = [5,5,5,10,20] Output :true explain : front 3 There are customers , We charge in order 3 Zhang 5 Dollar bills . The first 4 There are customers , We take one 10 Dollar bills , And return it 5 dollar . The first 5 There are customers , Let's return one 10 A dollar bill and a 5 Dollar bills . Because all customers get the right change , So we output true. |
Example 2:
Input :bills = [5,5,10,10,20] Output :false explain : front 2 There are customers , We charge in order 2 Zhang 5 Dollar bills . For the next 2 Customers , We take one 10 Dollar bills , And return it 5 dollar . For the last customer , We can't return 15 dollar , Because we only have two 10 Dollar bills . Because not every customer gets the right change , So the answer is false. |
Example 3:
Input :bills = [5,5,10] Output :true |
Example 4:
Input :bills = [10,10] Output :false |
Tips :
1 <= bills.length <= 105 bills[i] No 5 Namely 10 or 20 |
source : Power button (LeetCode)
link :https://leetcode-cn.com/problems/lemonade-change
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .
Ideas :
The cashier's idea is ok , Cash register yes 3 Lattice , Separately put 5,10,20
No money at work , The lattice is empty , Normal business is ok , No advance payment
Method 1 、 Count array
It is not strictly a counting array operation , It's similar
bool lemonadeChange(int* bills, int billsSize){
int count[3] = {0};
for(int i=0; i<billsSize; i++)
{
if(bills[i] == 5)
count[0]++;
else if(bills[i] == 10)
{
if(count[0] != 0)
{
count[0]--;
count[1]++;
}
else
return false;
}
else if(bills[i] == 20)
{
if(count[1] != 0)
{
count[1]--;
if(count[0] != 0)
{
count[0]--;
count[2]++;
}
else
return false;
}
else
{
if(count[0] >= 3)
{
count[0] -= 3;
count[2]++;
}
else
return false;
}
}
}
return true;
}
边栏推荐
- If you want to apply for a programmer, your resume should be written like this [essence summary]
- Opencv learning log 12 binarization of Otsu method
- Write web games in C language
- 树莓派4B安装opencv3.4.0
- Gartner: five suggestions on best practices for zero trust network access
- 7-1 懂的都懂 (20 分)
- Opencv learning log 15 count the number of solder joints and output
- Raspberry pie csi/usb camera uses mjpg to realize web camera monitoring
- Opencv learning log 14 - count the number of coins in the picture (regardless of overlap)
- mysql导入数据库报错 [Err] 1273 – Unknown collation: ‘utf8mb4_0900_ai_ci’
猜你喜欢
渗透测试 ( 7 ) --- 漏洞扫描工具 Nessus
Information security - Epic vulnerability log4j vulnerability mechanism and preventive measures
Matlab comprehensive exercise: application in signal and system
[teacher Gao UML software modeling foundation] collection of exercises and answers for level 20 cloud class
Quick to typescript Guide
Penetration test (4) -- detailed explanation of meterpreter command
【练习-5】(Uva 839)Not so Mobile(天平)
frida hook so层、protobuf 数据解析
Analysis of protobuf format of real-time barrage and historical barrage at station B
Ball Dropping
随机推荐
【高老师UML软件建模基础】20级云班课习题答案合集
Opencv learning log 12 binarization of Otsu method
Penetration test (8) -- official document of burp Suite Pro
Path problem before dynamic planning
Matlab comprehensive exercise: application in signal and system
Borg maze (bfs+ minimum spanning tree) (problem solving report)
信息安全-威胁检测-flink广播流BroadcastState双流合并应用在过滤安全日志
Common configuration files of SSM framework
【练习-8】(Uva 246)10-20-30==模拟
信息安全-安全专业名称|CVE|RCE|POC|VUL|0DAY
mysql导入数据库报错 [Err] 1273 – Unknown collation: ‘utf8mb4_0900_ai_ci’
[exercise 4-1] cake distribution
Penetration test (7) -- vulnerability scanning tool Nessus
【练习-9】Zombie’s Treasure Chest
【高老师软件需求分析】20级云班课习题答案合集
B - Code Party (girls' competition)
Data storage in memory & loading into memory to make the program run
Alice and Bob (2021牛客暑期多校训练营1)
Quick to typescript Guide
Nodejs+vue网上鲜花店销售信息系统express+mysql