递归的缺点:消耗时间和空间、栈溢出危险,重复计算。
改为循环
青蛙跳台阶:
public int JumpFloor1(int target) {
if (target == 1)
return 1;
if (target == 2)
return 2;
int numOne = 1;
int numTwo = 2;
int result = 0;
for (int i = 3; i <= target; i++) {
result = numOne + numTwo;
numOne = numTwo;
numTwo = result;
}
return result;
}