https://programmercarl.com/0746.%E4%BD%BF%E7%94%A8%E6%9C%80%E5%B0%8F%E8%8A%B1%E8%B4%B9%E7%88%AC%E6%A5%BC%E6%A2%AF.html

视频讲解：https://www.bilibili.com/video/BV16G411c7yZ

1.本题在理解题意的基础上添加了一个花费数组，其他与上一题的思路相似。

CPP

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

// for(int i = 2; i <= cost.size(); i++){
//    dpi = min(dp0 + cost[0], dp1 + cost[1]);
//    dp0 = dp1;
//    dp1 = dpi;
//}