这篇博客详细介绍了LeetCode第860题——柠檬水找零的解题过程。每个柠檬水售价5美元，顾客按顺序支付，使用5、10或20美元的纸币。你需要确保能为每位顾客提供正确的零钱，使得最终交易是顾客支付5美元。文章通过示例解释了如何确保找零正确，并提供了问题的解决方案。
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 th
订阅专栏 解锁全文
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
