Alwaldend
Docs
Light
Dark
Auto
Docs
Misc
Leetcode submissions
2025-08-24 17:22:24 +0300 MSK
2025-08-24 17:22:24 +0300 MSK
Minimum Cost to Reach Every Position
Tags:
Generated
Leetcode_submission
Links
https://leetcode.com/submissions/detail/1746703106/
Code
class
Solution
:
def
minCosts
(self, cost: List[int])
->
List[int]:
return
list(accumulate(cost, min))