题解 | #斐波那契数列#

class Solution {
public:
    
    int Fibonacci(int n) {

        if(n == 1 || n == 2) return 1;
        else  return Fibonacci(n - 1) +Fibonacci(n -2);
    }
};