【python3.8】斐波拉契数列实现
2022/8/29 1:22:45
本文主要是介绍【python3.8】斐波拉契数列实现,对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
import time def memoize(f): memo = {} def helper(x): if x not in memo: memo[x] = f(x) return memo[x] return helper @memoize def fib(n): if n == 0: return 0 elif n == 1: return 1 else: return fib(n-1) + fib(n-2) def fib_seq(n): res = [] if n > 0: res.extend(fib_seq(n-1)) res.append(fib(n)) return res # 耗时:7.870000000000099e-05 start_using_list = time.perf_counter() fib_seq(30) end_using_list = time.perf_counter() print(f'耗时:{end_using_list-start_using_list}') # def fib(n): # if n == 0: # return 0 # elif n == 1: # return 1 # else: # return fib(n-1) + fib(n-2) # # def fib_seq(n): # res = [] # if n > 0: # res.extend(fib_seq(n-1)) # res.append(fib(n)) # return res # # 耗时:1.2619506 # start_using_list = time.perf_counter() # fib_seq(30) # end_using_list = time.perf_counter() # print(f'耗时:{end_using_list-start_using_list}')
这篇关于【python3.8】斐波拉契数列实现的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-05-08有遇到过吗?同样的规则 Excel 中 比Python 结果大
- 2024-03-30开始python成长之路
- 2024-03-29python optparse
- 2024-03-29python map 函数
- 2024-03-20invalid format specifier python
- 2024-03-18pool.map python
- 2024-03-18threads in python
- 2024-03-14python Ai 应用开发基础训练,字符串,字典,文件
- 2024-03-13id3 algorithm python
- 2024-03-13sum array elements python