题目描述
一只青蛙一次可以跳上1级台阶,也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法(先后次序不同算不同的结果)。
方法
- 递归
- 循环
代码
- 递归
class Solution {
public:
int jumpFloor(int number) {
if (number == 1)
return 1;
else if (number == 2)
return 2;
else
{
return jumpFloor(number-1) + jumpFloor (number-2);
}
}
};
- 循环
class Solution {
public:
int jumpFloor(int number) {
int F_1 = 1;
int F_2 = 2;
int count;
if (number == 1)
return F_1;
if (number == 2)
return F_2;
while (number > 2)
{
count = F_1 + F_2;
F_1 = F_2;
F_2 = count;
number --;
}
return count;
}
};