没啥好说的,基础递归。
f(n)=f(1)+f(2)+f(3)+……f(n-1)
f(n-1)=f(1)+……+f(n-2)
f(n) = 2f(n-1)
class Solution {
public:
int jumpFloorII(int number) {
if(number<=1)
{
return number;
}
else{
return jumpFloorII(number-1)*2;
}
}
};