[算法] - 跳台阶 - 动态规划

public class Solution {
    public int jumpFloor(int target) {
        if(target == 1 || target == 2){
            return target;
        }
        
        return jumpFloor(target-1) + jumpFloor(target-2);
    }
}