本题目属于动态规划类解法
509. 斐波那契数
注意循环n-2轮
class Solution {
public:
int fib(int n) {
if(n<=1) return n;
int a = 0;
int b = 1;
int res;
for(int i=n-2;i>=0;i--){
res = a + b;
a = b;
b = res;
}
return res;
}
};
70. 爬楼梯
class Solution {
public:
int climbStairs(int n) {
if(n<=1) return 1;
int dp[2] = {0};
dp[0] = 1;//初始值根据题目变化
dp[1] = 1;
for(int i=n-2;i>=0;i--){
int res = dp[0] + dp[1];
dp[0] = dp[1];
dp[1] = res;
}
return dp[1];
}
};
746. 使用最小花费爬楼梯
注意最后一级台阶为dp[cost.size()]
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
vector<int> dp(cost.size()+1,0);
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()];
}
};