递归获得斐波那契数列java

package Class.recursion;

public class Fibonacci {
    // 获得斐波那契数组

    public int[] getArr(int len) {
        int []arr = new int[len];
        for (int i = 0; i < len; i++) {
            // 不重复调用斐波那契方法也可以获得数组, 将会降低复杂度
            arr[i] = getFib(i);
        }
        return arr;
    }

    public int getFib(int i) {
        if(i == 0 || i == 1) {
            return i;
        } else {
            return getFib(i - 1) + getFib(i - 2);
        }
    }
}

class Mainly {
    public static void main(String[] args) {
        Fibonacci tool = new Fibonacci();
        int arr[] = tool.getArr(10);
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + "\t");
        }
    }
}