什么是Java中Fibonacci类序列的非递归解？

public class Fibonacci {
    public Fibonacci() {
        this.fibonacci = new int[2];
        this.fibonacci[0] = 0;
        this.fibonacci[1] = 1;
    }
    
    private int fibonacci(int n) {
        if (n == 0) {
            return 0;
        }
        if (n == 1) {
            return 1;
        }
        int a = 0;
        int b = 1;
        for (int i = 2; i <= n; i++) {
            int c = a + b;
            a = b;
            b = c;
        }
        return b;
    }
    
    public static void main(String[] args) {
        Fibonacci fibonacci = new Fibonacci();
        for (int i = 0; i < 10; i++) {
            System.out.println(fibonacci.fibonacci(i));
        }
    }
}