- 509. 斐波那契数
class Solution {
public:
int fib(int n) {
if(n < 2)return n;
vector<int> f(n + 1);
f[0] = 0;
f[1] = 1;
for(int i = 2; i < f.size(); i++) {
f[i] = f[i - 1] + f[i - 2];
}
return f[n];
}
};
- 70. 爬楼梯
class Solution {
public:
int climbStairs(int n) {
if(n <= 2) return n;
vector<int> f(n + 1);
f[1] = 1;
f[2] = 2;
for(int i = 3; i < f.size(); i++) {
f[i] = f[i - 1] + f[i - 2];
}
return f[n];
}
};
- 746. 使用最小花费爬楼梯
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
// dp数组表示 到达当前台阶累计花费的体力值
// dp[i] = dp[i - 1] + cost[i - 1]
//或者 dp[i] = dp[i - 2] + cos[i - 2]
vector<int> dp(cost.size() + 1);
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()];
}
};