java递归方法实现斐波那契数列

用递归方式实现

实现的时候参考了如下链接

https://blog.csdn.net/No_overtime_apes/article/details/82634384

public static void test1() {
        int result = 0;
        for(int i =1;i<=3;i++) {
            result += countaa(i);
        }
        System.out.println(result);
    }
    public static int countaa(int n) {
        if(n == 1 ) {
            return 1;
        }else if (n == 2) {
            return 1;
        }else {
            return countaa(n-2) + countaa(n-1);
        }
    }