题目链接:
https://leetcode-cn.com/problems/lemonade-change/
题目描述:
题解:
class Solution {
public:
bool lemonadeChange(vector<int>& bills) {
unordered_map<int, int> billMap;
for(int bill: bills)
{
if(bill == 5)
++billMap[5];
else if(bill == 10)
{
if(billMap[5] >= 1)
{
billMap[5]--;
++billMap[10];
}else
return false;
}else
{
if(billMap[5] >= 1 && billMap[10] >= 1)
{
billMap[5]--;
billMap[10]--;
}else if(billMap[5] >= 3)
{
billMap[5] -= 3;
}else
return false;
}
}
return true;
}
};