题目链接:https://leetcode-cn.com/problems/min-cost-climbing-stairs/
这题给我看傻了…最后到楼顶不花钱我的天呐
代码如下:
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
int len = cost.size();
int dp[len + 1];
dp[0] = cost[0];
dp[1] = cost[1];
for(int i = 2; i < len; i++) {
dp[i] = min(dp[i - 2], dp[i - 1]) + cost[i];
//printf("第%d层,花费:%d\n", i, dp[i]);
}
dp[len] = min(dp[len - 1], dp[len - 2]);
return dp[len];
}
};