题解 | #斐波那契数列#

class Solution { //简单一次递归 public: int Fibonacci(int n) { if(n==1||n==2) return 1; else return Fibonacci(n-2)+Fibonacci(n-1);

}

};