跳台阶

斐波那契数列的变形

递归

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

递推

public class Solution {
    public int JumpFloor(int target) {
        int f[]=new int [100];
         
        f[1]=1;
        f[2]=2;
        for(int i=3;i<=target;i++){
            f[i]=f[i-1]+f[i-2];
        }
        return f[target];
    }
}