斐波那契1,1,2,3,5,8.... 求第n个数的斐波那契

1 def fib(n):
2     if n == 1 or n == 2:
3         return 1
4     return fib(n-1) + fib(n-2)
原文地址:https://www.cnblogs.com/seperinna/p/9776856.html