Re: [闲聊] 每日leetcode

楼主: DJYOMIYAHINA (通通打死)   2025-10-01 23:25:29
只有绿色可以给我救赎了
唉 一二三四五
def numWaterBottles(self, numBottles: int, numExchange: int) -> int:
rets, residual = 0, 0
while numBottles>0:
rets += numBottles
numBottles, residual = (numBottles+residual)//numExchange, (
numBottles+residual)%numExchange
return rets
昨天的
原本想说可以想一个什么解析解
但还是硬干了 对ㄚ
def triangularSum(self, nums: List[int]) -> int:
n = len(nums)
for i in range(n, 0, -1):
for j in range(i-1):
nums[j] = (nums[j]+nums[j+1])%10
return nums[0]
作者: oin1104 (是oin的说)   2025-10-01 23:27:00
我昨天也想过是不是能数学解 想一想我已经开始自动打出n^2了
楼主: DJYOMIYAHINA (通通打死)   2025-10-01 23:30:00
我直接帮你打出来
作者: SecondRun (雨夜琴声)   2025-10-01 23:33:00
登进去发现以前写过了 窝流泪了

Links booklink

Contact Us: admin [ a t ] ucptt.com