1.如有不正之处,请不吝指正
如下是青蛙跳台阶初级
public class Solution8 { //用递归实现,也可用for循环后一项等于前两项之和得到,就是一个斐波那契数列
public int JumpFloor(int target) {
if(target<= 0)
return 0;
if(target<3)
return target;
else
return JumpFloor(target-1)+JumpFloor(target-2);
}
}
以下是青蛙跳台阶变态版
public class Solution10 {
// public int JumpFloorII(int target) { //刚开始的想法
// int sum = 0;
// if (target<= 0)
// return 0;
// if (target == 1)
// return 1;
// else{
// for (int i = target-1; i > 0 ; i--) { //利用循环把f(target-1)+ ...f(1);
// sum += JumpFloorII(i) ;
// }
// return sum+1;
// }
//
// }
public int JumpFloorIII(int target) { //递归
if (target<= 0)
return 0;
if (target == 1)
return 1;
else{
return 2*JumpFloorIII(target-1); //找到规律f(target) = 2*f(target-1)
}
}
}