题目描述:
解题思路:
写出动态方程:dp[i] = min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2])
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
int n = cost.size();
int dp[n+1];
dp[0] = dp[1] = 0;
for(int i=2; i<=n; i++){
dp[i] = min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2]);
}
return dp[n];
}
};