小菜鸟系统学习Python-迭代实现斐波那契和汉诺塔问题

斐波那契:

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

    if n<1:
        print('输入错误,应该大于1')
        return -1

    while (n-2)>0:
        n3 = n2 + n1
        n1 = n2
        n2 = n3
        n-=1

    return n3



a = fbnq(10)
print('共有%d个兔子'%a)

汉诺塔:

def hnt(n,x,y,z):
    if n==1:
        print(x,'->',z)
    else:
        hnt(n-1,x,z,y)#将前n-1个从x移到y上
        print(x,'->',z)#将最下面的移动到z上
        hnt(n-1,y,x,z)#将这n-1个移z上


n = int(input('请输入层数:'))
hnt(n,'x','y','z')

结果: