斐波那契数列

递归实现`

public static int fibonacci(int n) {
if(n==1){
    return 1;
}
if(n==2){
    return 1;
}
    return fibonacci(n-1)+fibonacci(n-2);
    }

非递归

 int[] fib = new int[40];
        fib[0] = 0;
        fib[1] = 1;
        for(int i = 2; i <= n; i++){
            fib[i] = fib[i-1] + fib[i-2];
        }
        return fib[n];