题目链接:Leetcode746
Code:
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
//dp[i]表示跳到第i层的花费
vector<int> dp(cost.size()+1, 0);
dp[0] = 0;
dp[1] = cost[0];
int n = cost.size();
for (int i = 2; i <= n; i++)
dp[i] = min(dp[i-1], dp[i-2])+cost[i-1];
return min(dp[n], dp[n-1]);
}
};