_746. Min Cost Climbing Stairs.md

746. Min Cost Climbing Stairs

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : July 05, 2024

Last updated : July 05, 2024

---

Related Topics : Array, Dynamic Programming

Acceptance Rate : 66.27 %

---

Solutions

• e746.py

Python

e746.py

class Solution:
    def minCostClimbingStairs(self, cost: List[int]) -> int:
        dp = [0] * 2 + [0] * len(cost)
        for i, cost in enumerate(cost, 2) :
            dp[i] = cost + min(dp[i - 1], dp[i - 2])
        return min(dp[-2:])