题解 | #跳台阶#
跳台阶
http://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4
public class Solution {
public int jumpFloor(int target) {
int[] dp = new int[41];
dp[1] = 1;
dp[2] = 2;
for(int i = 3; i < 40; i++) {
dp[i] = dp[i - 2] + dp[i - 1];
}
return dp[target];
}
}
