python实现费波纳茨数列——递归、迭代

最近开始学习Python，把一些写的小练习上传下

迭代

def fb(n):
    n1 = 1
    n2 = 1
    n3 = 1

    if n < 1:
        print('is error num')
        return -1
    while (n -2) > 0:
        n3 = n2 + n1
        n1 = n2
        n2 = n3
        n -=1
        print(n1,n2,n3,n)


    return n3

result = fb(5)
print(result)

递归

def fb(n):
    if n < 1:
        print("is error num")
        return -1

    if n == 1 or n == 2:
        return 1
    else:
        return fb(n-1) + fb(n-2)

result = fb(5)
print(result)