解法1 递归(时间复杂度o(你)) public class Solution { public int Fibonacci(int n) { if (n==0||n==1){ return n; }else { return Fibonacci(n-1)+Fibonacci(n-2); } } } public class Solution { public int Fibonacci(int n) { if(n<=1){ ...