1518. Water Bottles
Read the full problem statement on LeetCode.
Difficulty: easy Acceptance: 71% Topics: Math, Simulation
View full problem on LeetCode Reading material
Reference solution (spoiler · python)
# Time: O(logn/logm), n is numBottles, m is numExchange
# Space: O(1)
class Solution(object):
def numWaterBottles(self, numBottles, numExchange):
"""
:type numBottles: int
:type numExchange: int
:rtype: int
"""
result = numBottles
while numBottles >= numExchange:
numBottles, remainder = divmod(numBottles, numExchange)
result += numBottles
numBottles += remainder
return result
Solution from kamyu104/LeetCode-Solutions · MIT
Similar questions