Fibonacci数列Java实现

Fibonacci数列：如是：[1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]

f(0) = 1; f(1) = 1; f(n) = f(n-1)+f(n-2) n>1;

import java.util.Arrays;

public class Test {

    public static void main(String[] args) {
        Test test = new Test();
        int n = 15;
        int[] fibonacciArray = new int[n]; 
        for (int i = 0; i < n; i++) {
            fibonacciArray[i] = test.fibonacci(i);//将n处的值存入数组中
        }
        System.out.println(Arrays.toString(fibonacciArray));
    }
    
    //递归求解n处的值
    private int fibonacci(int n){
        if(n==0||n==1){
            return 1;
        }
        else if(n>1){
            return fibonacci(n-1)+fibonacci(n-2);
        }
        else{
            return 0;
        }
    }
}

输出：
　　　[1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610]

//普通循环求解
int n1 = 15;
for(int i = 0; i<n1; i++){
    if(i==0 || i==1){
    fibnacciArray1[i] = 1;
    }
    else{
        fibnacciArray1[i] = fibnacciArray1[i-1]+fibnacciArray1[i-2];
    }
}
System.out.println(Arrays.toString(fibnacciArray1));

输出：
　　　　[1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610]