题目理解:
题解:
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
int n = cost.size();
vector<int>dp(n+1);
dp[0] = 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];
}
};
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
int n = cost.size();
if(n<=1)return 0;
int sum=0;
int a = 0;
int b = 0;
for(int i = 2;i <= n;i++){
sum = min(b+cost[i-1],a+cost[i-2]);
a = b;
b = sum;
}
return sum;
}
};