java recursive method to achieve Fibonacci number

Recursive manner

When implemented with reference to the following link

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

 1 public static void test1() {
 2         int result = 0;
 3         for(int i =1;i<=3;i++) {
 4             result += countaa(i);
 5         }
 6         System.out.println(result);
 7     }
 8     public static int countaa(int n) {
 9         if(n == 1 ) {
10             return 1;
11         }else if (n == 2) {
12             return 1;
13         }else {
14             return countaa(n-2) + countaa(n-1);
15         }
16     }