class Solution {
public:
int climbStairs(int n) {
// 0 1 = 1
int p = 0,q = 0,r = 1;
for(int i = 1;i <= n;i++){
p = q;
q = r;
//fx = f x -1 + f x - 2
r = p + q;
}
return r;
}
};
70. 爬楼梯
最新推荐文章于 2024-05-22 16:06:14 发布