动态规划之斐波那契数

动态规划

斐波那契数

/*
   斐波那契数列
 */
public class Fit {

    public static int fit(int n){
        if(n<2){
            return n;
        }
        int[] dp = new int[n+1];
        //边界值的初始化
        dp[1] = 1;
        for (int i = 2; i <= n ;i++){
            //状态转移方程
            dp[i] = dp[i-1] + dp[i-2];
        }
        return dp[n];
    }

    public static void main(String[] args) {
        int num = 0;
        Scanner scanner = new Scanner(System.in);

        if (scanner.hasNextInt()){
           num = scanner.nextInt();
           fit(num);
           System.out.println(fit(num));
        }else{
            System.out.println("输入的不是自然数！");
        }
    }

}```