编辑代码

class Main {
	public static void main(String[] args) {
        int n = 10;
        System.out.print("递推结果：");
        for (int i = 0; i <= n; i++) {
            System.out.print(fibonacciIterative(i) + " ");
        }
        System.out.print("\n");
        System.out.print("递归结果：");
        int n2=10;
        for (int i = 0; i <= n2; i++) {
            System.out.print(fibonacciRecursivea(i) + " ");
        }
	}


   static int fibonacciRecursivea(int n) {
        if (n <= 1) {
            return n;
        } else {
            return fibonacciRecursivea(n - 1) + fibonacciRecursivea(n - 2);
        }
    }


     static int fibonacciIterative(int n) {
        if (n <= 1) {
            return n;
        }
        int a = 0;
        int b = 1;
        for (int i = 2; i <= n; i++) {
            int temp = a + b;
            a = b;
            b = temp;
        }
        return b;
    }
}