/*本题是模拟题,爬到第n层的步数为:
f(n) = f(n-1) + f(n-2);
即:到第n层的方法是从第n-1层跨一步和从
第n-2步跨两步。
方法参考自: https://github.com/soulmachine/leetcode*/
class Solution {
public:
int climbStairs(int n) {
int pre(0), cur(1);
for(int i = 1; i <= n; ++i){
int tmp(cur);
cur += pre;
pre = tmp;
}
return cur;
}
};
LeetCode之Climbing Stairs
最新推荐文章于 2019-04-08 11:29:52 发布