一只青蛙一次可以跳上1级台阶,也可以跳上2级……它也可以跳上n级。求该青蛙跳上一个n级的台阶总共有多少种跳法。
解题思路:
题目给出每次可以跳上1级台阶,也可以跳上2级台阶所以给出推到过程如下:
f(0) = 0
f(1) = 1
f(2) = f(2 - 1) + f(2-2) = f(1) + f(0) = 1
f(3) = f(3 - 1) + f(3 - 2) + f(3 - 3) = f(2) + f(1) + f(0) = 2;
…
f(n - 1) = f(n - 2) + f(n - 3) + f(n - 4) + … + f((n - 1) - (n - 1))
f(n) = f(n - 1) + f(n - 2) + f(n - 3) + … + f(n -(n - 1)) + f(n - n)
因为
…
f(n - 2) = …
f(n - 1) = f(n - 2) + f(n - 3) + f(n - 4) + … + f((n - 1) - (n - 1))
所以
f(n) = f(n - 2) + f(n - 3) + f(n - 4) + … + f((n - 1) - (n - 1)) + f(n - 2) + f(n - 3) + … + f(n -(n - 1)) +
f(n - n) = 2*(f(n - 2) + f(n - 3) + f(n - 4) + … + f((n - 1) - (n - 1))) = 2*(f(n - 1))
综上:
f(0) = 0
f(1) = 1
f(n) = 2*f(n - 1)
class Solution {
public:
int jumpFloorII(int number) {
if(number < 0)
{
return -1;
}
if(number == 0)
{
return 0;
}
if(number == 1)
{
return 1;
}
int ret = 1;
for(int i = 2; i <= number; i++)
{
ret *= 2;
}
return ret;
}
};