第五天

DP-Fibo/Climbing Stairs

dp[i]=dp[i-1]+dp[i-2]

package LeeCodeCrack;

public class DPClimbingStairs {
    
    public static int fi (int n){
        int[] a= new int[n+1];
        if (n==0){
            return 0;
        }else if (n==1)
            return 1;
        
        a[0]=0;
        a[1]=1;
        for(int i=2;i<=n;i++){
        a[i]=a[i-1]+a[i-2];
        System.out.println(a[i]);
        }
        return a[n];
    }

    public static void main (String[] args){
        fi(9);
        //System.out.println(fi(9));
        
        
    }

}

Recursive

package LeeCodeCrack;

public class Fibo {

    public static int Fibo(int n) {
        if(n==0) return 0;
        if(n==1) return 1;
        return Fibo(n-1)+Fibo(n-2);
    }
    
    public static void main (String[] args){
        System.out.println(Fibo(9));
    }
}