代码随想录算法训练营第三十八天| 509. 斐波那契数、70. 爬楼梯、746. 使用最小花费爬楼梯
509. 斐波那契数
题目链接
文章讲解
class Solution {
public:
int fib(int n) {
if (n <= 1) return n;
int dp[2] = {0, 1};
for (int i = 2; i <= n; i++) {
int sum = dp[0] + dp[1];
dp[0] = dp[1];
dp[1] = sum;
}
return dp[1];
}
};
70. 爬楼梯
题目链接
文章讲解
class Solution {
public:
int climbStairs(int n) {
if (n <= 1) return n;
int dp[2] = {1, 2};
for (int i = 3; i <= n; i++) {
int sum = dp[0] + dp[1];
dp[0] = dp[1];
dp[1] = sum;
}
return dp[1];
}
};
746. 使用最小花费爬楼梯
题目链接
文章讲解
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
int size = cost.size();
int dp[2] = {0};
for (int i = 2; i <= size; i++) {
int sum = min(dp[0] + cost[i - 2], dp[1] + cost[i - 1]);
dp[0] = dp[1];
dp[1] = sum;
}
return dp[1];
}
};