|
本帖最后由 傻眼貓咪 于 2021-8-5 20:05 编辑
- # Fibonacci Sequences: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610
- def fibonacci(n, SUM = 0):
- if n == 0:
- return 0
- elif n == 1:
- return 1
- SUM += (fibonacci(n-1, SUM)+fibonacci(n-2, SUM))
- return SUM
- def listFibonacci(n):
- list = []
- for i in range(n+1):
- list.append(fibonacci(i))
- return list
复制代码
或更好寫法
- def fibonacci(n, SUM = 0):
- if n == 0: return 0
- elif n == 1: return 1
- SUM += (fibonacci(n-1, SUM)+fibonacci(n-2, SUM))
- return SUM
- n = 10
- list = [fibonacci(i) for i in range(n)]
复制代码 |
|