题解 | #跳台阶#

import java.util.*;

public class Solution {
    public int jumpFloor(int target) {
        int a = target;
        if(target == 1){
            return 1;
        }
        if(target == 2){
            return 2;
        }
        
        //dp[i] 表示 跳上i 最多的方方法数
        int[] dp = new int[a + 1];
        dp[1] = 1;
        dp[2] = 2;
        
        for (int i = 3; i <= a; i++) {
            //最后一步是单步
            int n = 0;
            if(i >= 2){
                n = dp[i - 2];
            }
            dp[i] = dp[i-1] + n;
        }
        
        return dp[a];
    }
}