类似斐波那契数列
public class Solution {
public int JumpFloor(int target) {if(target == 0) {
return 0;
}
if(target < 3) {
int[] a = {0,1,2};
return a[target];
}
return (JumpFloor(target - 1)+ JumpFloor(target -2));
}
}
类似斐波那契数列
public class Solution {
public int JumpFloor(int target) {