题解 | #斐波那契数列#

public class Solution {
    public int Fibonacci(int n) {
     if (n == 1 || n == 2) {
            return 1;
        }

        return Fibonacci(n - 2) + Fibonacci(n - 1);
    }
}