1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94
| #算法基本整理
def func2(n): if n > 0: func2(n - 1) print(n)
# func2(2) # 输出2 # func2(1) # 输出1 # func2(0) # 没有输出 # func2(2)
# print("====", end="\n") # print("====", end="")
def func3(n): if n > 0: print("抱着", end="") func3(n - 1) print("的我", end="") else: print("我的小鲫鱼", end="")
# func3(3) # 输出 抱着 # func3(2) # 再输出 抱着 # func3(1) # 再输出 抱着 # func3(0) # 输出 我的小鲫鱼 # 的我 # 的我 # 的我
# func3(3) import time
def cal_time(func): def inner(*args, **kwargs): start = time.time() ret = func(*args, **kwargs) stop = time.time() temp = stop - start print(f'函数执行了{temp}秒') return ret
return inner
def fbnqxl(n): if n == 0 or n == 1: return 1 else: return fbnqxl(n - 1) + fbnqxl(n - 2)
@cal_time def fib1(n): return fbnqxl(n)
@cal_time def fib2(n): li = [1, 1] for i in range(2, n + 1): # li.append(li[i - 1] + li[i - 2]) li.append(li[-1] + li[-2]) return li[n]
# 1 1 2 3 5 8
@cal_time def fib3(n): a = 1 b = 1 c = 1 for i in range(2, n + 1): c = a + b a = b b = c return c
# print(fib1(20)) # print(fib2(10000)) # print(fib3(10))
|