f(n)=f(n-1)+f(n-2)
1.动态规划
class Solution {
public:
int climbStairs(int n) {
int a=0,b=0,c=1;
for(int i=1;i<=n;i++){
a=b;
b=c;
c=a+b;
}
return c;
}
};
f(n)=f(n-1)+f(n-2)
class Solution {
public:
int climbStairs(int n) {
int a=0,b=0,c=1;
for(int i=1;i<=n;i++){
a=b;
b=c;
c=a+b;
}
return c;
}
};