f[n] = f[n-1] + f[n-2] + … + f[0]
那么f[n-1] 为多少呢?
f[n-1] = f[n-2] + f[n-3] + … + f[0]
所以一合并,f[n] = 2*f[n-1],初始条件f[0] = f[1] = 1
public int JumpFloorII2(int target) {
if (target == 0) {
return 0;
}
if (target == 1) {
return 1;
}
return 2*JumpFloorII2(target-1);