JZ08-跳台阶
跳台阶
https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4?tpId=13&tags=&title=&diffculty=0&judgeStatus=0&rp=1&tab=answerKey
public class Solution {
public int JumpFloor(int target) {
if(target<=2){
return target;
}
int[] dp = new int[target+1];
dp[0] = 0;
dp[1] = 1;
dp[2] = 2;
for(int i=3;i<target+1;i++){
dp[i] = dp[i-1] + dp[i-2];
}
return dp[target];
}
} 
