标签：return no -- fibnacci 斐波 num print 那契
博客地址：https://www.cnblogs.com/zylyehuo/
# -*- coding: utf-8 -*-
# 子问题的重复计算--递归方法--执行效率低
def fibnacci(n):
if n == 1 or n == 2:
return 1
else:
return fibnacci(n - 1) + fibnacci(n - 2)
# print(fibnacci(100))
# 动态规划（DP）的思想 = 递推式 + 重复子问题
def fibnacci_no_recurision(n):
f = [0, 1, 1]
if n > 2:
for i in range(n - 2):
num = f[-1] + f[-2]
f.append(num)
return f[n]
print(fibnacci_no_recurision(100))
标签：return,
no,
--,
fibnacci,
斐波,
num,
print,
那契
From： https://www.cnblogs.com/zylyehuo/p/17642344.html
