[leetcode] 1518. Water Bottles

[leetcode] 1518. water Bottles

Description

Given numBottles full water bottles, you can exchange numExchange empty water bottles for one full water bottle.

The operation of drinking a full water bottle turns it into an empty bottle.

Return the maximum number of water bottles you can drink.

Example 1:

Input: numBottles = 9, numExchange = 3Output: 13Explanation: You can exchange 3 empty bottles to get 1 full water bottle.Number of water bottles you can drink: 9 + 3 + 1 = 13.

Example 2:

Input: numBottles = 15, numExchange = 4Output: 19Explanation: You can exchange 4 empty bottles to get 1 full water bottle. Number of water bottles you can drink: 15 + 3 + 1 = 19.

Example 3:

Input: numBottles = 5, numExchange = 5Output: 6Example 4:Input: numBottles = 2, numExchange = 3Output: 2

Constraints:

1 <= numBottles <= 1002 <= numExchange <= 100

分析

题目的意思是：给定numBottles个水瓶和numExchange，numExchange表示的是numExchange个空瓶可以兑换一个水瓶。如果弄懂了意思之后，就是一道智力题了，把这个过程模拟出来就可以了，我写了一个while循环来模拟这个过程了哈。

代码

class Solution: def numWaterBottles(self, numBottles: int, numExchange: int) -> int: res=0 while(numBottles>=numExchange): bottle=numBottles//numExchange t=bottle*numExchange res+=t numBottles-=t numBottles+=bottle return res+numBottles

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。