时间限制:1秒空间限制:32768K
通过比例:27.78%
最佳记录:0 ms|8552K (来自 左小右)
题目描述
一只青蛙一次可以跳上1级台阶,也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。
提示超时的算法(递归法):
class Solution {
public:
int jumpFloor(int number) {
int count = number;
return jump(number, count);
}
private:
int jump(int number, int count) {
int methodNum = 0;
if(count < 0) {
return 0;
}
else if(count == 0) {
return 1;
}
for(int i = 0; i <=1; i++) {
count--;
methodNum += jump(number, count);
}
return methodNum;
}
};
正确的算法(递归法),耗时:970ms:
class Solution {
public:
int jumpFloor(int number) {
int count = number;
return jump(number, count);
}
private:
int jump(int number, int count) {
int methodNum = 0;
if(count == 1) {
return 1;
}
if(count == 2) {
return 2;
}
if(count > 1) {
methodNum += jump(number, count - 1);
}
if(count > 2) {
methodNum += jump(number, count - 2);
}
return methodNum;
}
};
最优的算法(归纳法),耗时:0:
当台阶数为1时答案为1,台阶数为2时答案为2,当台阶数为n时答案为f(n)=f(n-1)+f(n-2)。
故此利用斐波那契数列算法:
http://blog.csdn.net/u010456484/article/details/48289277
class Solution {
public:
int jumpFloor(int number) {
return Fibonacci(number + 1);
}
private:
int Fibonacci(int n) {
if(n == 0 ) {
return 0;
}
else if(n == 1) {
return 1;
}
else {}
int a = 0, b = 1, num, i;
for(i = 2; i <= n; i++) {
num = a + b;
a = b;
b = num;
}
return num;
}
};