Java求斐波那契数列的第n项(迭代实现)

    public static int func4(int n) {
        //求斐波那契数列的第n项。(迭代实现)
        if (n == 1 || n == 2) {
            return 1;
        }else{
            int a = 1;
            int b = 1;
            int c = 0;
            for (int i = 3; i <= n; i++) {
                c = a + b;
                a = b;
                b = c;
            }
            return c;
        }
    }
    public static void main(String[] args) {

        System.out.println(func4(4));
    }

输出结果：