algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-07 01:44:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 1518 solution

Browse Source
This commit is contained in:
halfrost
2021-12-21 21:21:21 +08:00
parent c99d3ef68f
commit 577d3d465f
5 changed files with 86 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
leetcode/1518.Water-Bottles/README.md
View File

@ -1,4 +1,4 @@
# [1518. Water Bottles](https://leetcode-cn.com/problems/water-bottles/)
# [1518. Water Bottles](https://leetcode.com/problems/water-bottles/)
## 题目
@ -51,8 +51,7 @@ Return the maximum number of water bottles you can drink.
## 解题思路
- 模拟
首先我们一定可以喝到 numBottles 瓶酒，剩下 numBottles 个空瓶。接下来我们可以拿空瓶子换酒，每次拿出 numExchange 个瓶子换一瓶酒，然后再喝完这瓶酒，得到一个空瓶。这样模拟下去，直到所有的空瓶子小于numExchange结束
- 模拟。首先我们一定可以喝到 numBottles 瓶酒，剩下 numBottles 个空瓶。接下来我们可以拿空瓶子换酒，每次拿出 numExchange 个瓶子换一瓶酒，然后再喝完这瓶酒，得到一个空瓶。这样模拟下去，直到所有的空瓶子小于numExchange结束。
## 代码