Leetcode day 32: Find the Student that Will Replace the Chalk

2024-09-02 13:41

讚

回覆

轉發

粉絲

串文

54+

無資料

(讚 + 回覆 + 轉發) / 粉絲數

NaN%

最先回覆的內容
發文後	用戶	內容
一小時內	Abdullah Ansari theabdullahansari	Solved it too. I kept Subtract the element until k<0 and broke the loop when that happened, returning the index at that time.