斐波那契数列

动态规划：即子问题的重复计算

斐波那契数列:

# 斐波那契数列

def fibnacii(n):　　# 递归方式
    if n == 1 or n == 2:
        return 1
    else:
        return fibnacii(n-1) + fibnacii(n-2)

print(fibnacii(6))

# 动态规划（DP）
def fibnacii_no_reccurision(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(fibnacii_no_reccurision(6))