斐波纳契数

public class Recursion {
    public static void main(String[] args) {
        T t1=new T();

        int res=t1.Fibonacci(7);
        System.out.println("Fibonacci(7)="+res);
    }
}

class T {

    public int Fibonacci(int n) {
        if (n >= 1) {
            if (n == 1 || n == 2) {
                return 1;
            } else {
              return Fibonacci(n - 1) + Fibonacci(n - 2);
            }
        }
        else {
            System.out.println("需要输入大于大于1的整数");
            return -1;
        }


    }
}