题解 | #跳台阶#

public class Solution {
    public int jumpFloor(int target) {
        int[] dp = new int[target +1];
        if(target == 1) return 1;
        if(target == 2) return 2;
        dp[1] = 1;
        dp[2] = 2;
        for(int i = 3; i <= target; i++){
            dp[i] = dp[i-1] + dp[i-2];
        }
        return dp[target];
    }
}