不限定语言,写一个函数,输入n输出斐波那契数列的第n项。
public class Solution { public int Fibonacci(int n) { if(n == 0) return 0; if(n == 1) return 1; return Fibonacci(n - 1) + Fibonacci(n - 2); } }
class Solution: def Fibonacci(self, n): # write code here p, q, r = 0, 1, 1 if n == 0: return p if n == 1: return q for i in range(1, n): r = p + q p = q q = r return r