使用递归的方式完成斐波那契数列

public class test {
    public static void main(String[] args) {
        method me = new method();
        int m = me.fib(2);
        System.out.println(m);
    }
}

class method {
    public int fib(int n) {
        if (n == 1 || n == 2) return 1;
        else return fib(n - 1) + fib(n - 2);
    }
}