题解 | #斐波那契数列#
斐波那契数列
https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
public class Solution { public int a(int n){ if(n == 1 || n == 2){ return 1; }else{ return a(n-1) + a(n - 2); } } public int Fibonacci(int n) { int ans = a(n); return ans; } }