问题描述
问题分析
- 跳台阶问题,具体解释见 剑指offer-跳台阶
代码实现
class Solution {
public int climbStairs(int n) {
if (n <= 2) {
return n;
}
int preVal = 1;
int curVal = 2;
for (int i = 3; i <= n; i++) {
curVal = preVal + curVal;
preVal = curVal - preVal;
}
return curVal;
}
}