JAVA算法：斐波那契数列

两种斐波那契数列的写法

public class Feibonaqi {
    public static void main(String[] args) {
        System.out.println(demo(10));
        demo2(100);
    }

    static int demo(int i){
        if(i == 1 || i == 2){
            return 1;
        }
        return demo(i - 1) + demo(i - 2);
    }

    static void demo2(int value){
        int[] arr = new int[value];
        arr[0] = arr[1] = 1;
        for (int i = 2; i < arr.length; i++) {
            arr[i] = arr[i - 1] + arr[i - 2];
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
            if(i % 5 == 0 && i != 0){
                System.out.println();
            }
        }
    }
}