day16_Task_斐波那契数列

import java.util.Scanner;

/*
   作业：
   斐波那契数列
   n = 1 2 3 4 5 6 7  8   ...   项数
       1 1 2 3 5 8 13 21 ...    值
   使用递归 打印出前面20项
   f(n) = f(n-1) + f(n-2)  递归公式
    */
public class Task {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        System.out.println("请输入你要获取前多少项的值:");
        int count = input.nextInt() + 1  ;
        int[] arr = new int[count];
        for (int i = 1; i < arr.length; i++) {
            arr[i] = func(i);
            System.out.print("第" + i + "项:" + arr[i] +" ");
        }
    }
    public static int func(int num){
        if(num == 1 || num == 2){
            return 1;
        }
        else
            return func(num - 1) + func(num - 2);
    }
}