表态青蛙跳台阶
变态跳台阶
http://www.nowcoder.com/questionTerminal/22243d016f6b47f2a6928b4313c85387
class Solution {
public: //1级台阶:1种 2级台阶:2种 3级台阶:4种 4级台阶:8种
//即满足:跳法=2的number-1次方
int jumpFloorII(int number) {
if(number<=1)
{
return number;
}
int sum=1;
while(number-1)
{
sum*=2;
number--;
}
return sum;
}
};