递归求出第n项斐波那契数列_Java

public class test_Febonacci {
    public static void main(String[] args) {
        //斐波那契额数列: 1 1 2 3 5 8 13
        //输出第n项斐波那契数列,以7为例
        System.out.println(febonacci(7));

    }

    public static int febonacci(int i) {
        if (i == 1 || i == 2) {
            return 1;
        } else {
            return febonacci(i - 1) + febonacci(i - 2);
        }
    }
}

输出: