746_MinCostClimbingStairs - a920604a/leetcode GitHub Wiki

class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        
        //  10  15  20
        //          15  
        
        
        //  1   100 1   1   1   1   100 1   1   100 1
        //          1   
        int n = cost.size();
        vector<int> dp(n+1,0);
        for(int i=2;i<n+1;++i){
            dp[i] = min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2]);
        }
        return dp.back();
        
    }
};