509.斐波那契数列
dp开篇!
class Solution {
public:
int fib(int n) {
if(n <= 1) return n;
int dp[2];
dp[0] = 0;
dp[1] = 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 <= 2) return n;
int dp[3];
dp[1] = 1;
dp[2] = 2;
for(int i = 3; i <= n; i++){
int sum = dp[1] + dp[2];
dp[1] = dp[2];
dp[2] = sum;
}
return dp[2];
}
};
746.使用最小花费爬楼梯
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
vector<int> minCost(cost.size() + 1);
if(cost.size() <= 1) return 0;
minCost[0] = 0;
minCost[1] = 0;
for(int i = 2; i <= cost.size(); i++){
minCost[i] = min(minCost[i - 1] + cost[i - 1], minCost[i - 2] + cost[i - 2]);
}
return minCost[cost.size()];
}
};