换水问题
class Solution:
def numWaterBottles(self, numBottles: int, numExchange: int) -> int:
# a = numBottles
# b = 0
# ans = 0
# # 喝完才换
# while a > 0:
# b += a
# ans += a
# # a = b // numExchange
# # b = b % numExchange
# a, b = divmod(b, numExchange)
# return ans
ans = 0
# 有够数量就换
while numBottles >= numExchange:
ans += numExchange # 喝水
numBottles -= numExchange - 1 # numExchange瓶换一瓶
# 不够数了,返回喝过的与换不了的数量之和
return ans + numBottles
函数divmod()
divmod() 函数可以同时返回商和余数,结果是一个包含商和余数的元组。
a = 200
b = 100
result = divmod(a, b)
print(result) # 输出 (2, 0)
a = 202
b = 100
result = divmod(a, b)
print(result) # 输出 (2, 2)
811

被折叠的 条评论
为什么被折叠?



