斐波那契 迭代实现(java)

public class Itera {

    public int fun(int n) {
        int f0 = 0;
        int f1 = 1;
        if (n == 0) {
            return f0;
        }
        if (n == 1) {
            return f1;
        }

        while (n - 1 > 0) {
            int temp = f1;
            f1 = f0 + f1;
            f0 = temp;
            n--;
        }
        return f1;
    }

    public static void main(String[] args) {
        Itera itera = new Itera();
        System.out.println(itera.fun(0));
        System.out.println(itera.fun(1));
        System.out.println(itera.fun(2));
        System.out.println(itera.fun(3));
        System.out.println(itera.fun(4));
        System.out.println(itera.fun(5));
        System.out.println(itera.fun(6));

    }

}