509. 斐波那契数
class Solution {
public:
int fib(int n) {
if(n<2) return n;
int f0 = 0;
int f1 = 1;
int res =0;
while(n>=2)
{
res = f0+f1;
f0 = f1;
f1 = res;
n--;
}
return res;
}
};
70. 爬楼梯
class Solution {
public:
int climbStairs(int n) {
if(n<3) return n;
int dp2 = 1;
int res = 2;
while(n>2)
{
res = res+dp2;
dp2 = res-dp2;
n--;
}
return res;
}
};
746. 使用最小花费爬楼梯
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
int dp0 = 0;
int dp1 = 0;
int res = 0;
for(int i =2; i<=cost.size();i++)
{
res = min(dp0+cost[i-2], dp1+cost[i-1]);
dp0 = dp1;
dp1 = res;
}
return res;
}
};