题解 | #跳台阶#
跳台阶
http://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4
经典的动态规划-计数问题
public class Solution {
public int jumpFloor(int target) {
if(target<3)
return target;
int[] dp = new int[target+1];
//初始化
dp[0] = 0;
dp[1] = 1;
dp[2] = 2;
for(int i=3;i<=target;i++){
dp[i] = dp[i-1]+dp[i-2];
}
return dp[target];
}
}
查看12道真题和解析