[LeetCode]MinCostClimbingStairs / dp

https://leetcode.com/problems/min-cost-climbing-stairs/

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

이전에 내가 어떤 칸을 밟을 지는 그 칸에 올라가서 결정하는 것!