一只青蛙一次可以跳上1级台阶,也可以跳上2级……它也可以跳上n级。求该青蛙跳上一个n级的台阶总共有多少种跳法。
思路:s(n) 表示n级台阶的跳法数。则有
s(n) = s(n-1) + s(n-2) + s(n-3) + ... + s(1) (1)
s(n-1) = s(n-2) + s(n-3) + ... + s(1) (2)
(1) - (2) 则 s(n) - s(n-1) = s(n-1)
所以 s(n) = 2 * s(n-1)
// 递归写法
class Solution {
public:
int jumpFloorII(int number) {
if (number <= 0)
return 0;
if (number == 1)
return 1;
return 2*jumpFloorII(number - 1);
}
};
//非递归写法
class Solution {
public:
int jumpFloorII(int number) {
if (number <=0) return 0;
if (number <= 2) return number;
int res = 2;
for (int i = 3; i <= number; ++i)
res *= 2;
return res;
}
};