Java解题方案
变态跳台阶
http://www.nowcoder.com/questionTerminal/22243d016f6b47f2a6928b4313c85387
public class Solution {//规律是f(n) = f(n-1)
public int JumpFloorII(int target) {
int sum = 1;
if(target == 0)
return 0;
for(int i = 1;i < target; i++)
sum = 2* sum;
return sum;
}
}
阿里巴巴稳定性 75人发布
投递阿里巴巴等公司10个岗位
