题目描述
点这里
思路分析
递推/dp
f
[
i
]
:
f[i]:
f[i]:跳到第i阶楼梯的方法数
f
[
i
]
=
f
[
i
−
1
]
+
f
[
i
−
2
]
f[i]=f[i-1]+f[i-2]
f[i]=f[i−1]+f[i−2]
代码实现
class Solution {
public:
int climbStairs(int n) {
int a = 1, b = 1;
while ( -- n) {
int c = a + b;
a = b, b = c;
}
return b;
}
};