剑指offer系列(8)跳台阶
解题思路:动态规划。与斐波那契数列求解相同。
class Solution {
public:
int jumpFloor(int number) {
if (number <= 2) return number;
int x = 1;
int y = 2;
for (int i = 3; i <= number; i++){
int cur = x + y;
x = y;
y = cur;
}
return y;
}
执行结果