Min Cost Climbing Stairs LeetCode solution in Python

1
class Solution:
2
    def minCostClimbingStairs(self, cost: List[int]) -> int:
3
        cur = 0
4
        dp0 = cost[0]
5
        if len(cost) >= 2:
6
            dp1 = cost[1]
7

8
        for i in range(2, len(cost)):
9
            cur = cost[i] + min(dp0, dp1)
10
            dp0 = dp1
11
            dp1 = cur
12

13
        return min(dp0, dp1)