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