题解 | #跳台阶扩展问题#
跳台阶扩展问题
http://www.nowcoder.com/practice/22243d016f6b47f2a6928b4313c85387
public class Solution {
public int jumpFloorII(int target) {
if (1 == target) {
return 1;
}
int pre = 1;
for (int i = 1; i < target; i++) {
pre *= 2;
}
return pre;
}
}
字节跳动工作强度 689人发布
