python 递归-汉诺塔

发布时间：2020-12-20 12:47:02 所属栏目：Python 来源：网络整理

导读：# 汉诺塔 a = " A " b = " B " c = " C " def hano(a,b,c,n): if n == 1 : print ( " {} -- {} " .format(a,c)) if n == 2 : print ( " {} -- {} " .format(a,c)) print ( " {} -- {} " .format(a,b)) print ( " {} -- {} " .format(b,c)) return None hano(

# 汉诺塔
a = "A"
b = "B"
c = "C"
def hano(a,b,c,n):
    if n == 1:
        print("{} --> {}".format(a,c))
    if n == 2:
        print("{} --> {}".format(a,c))
        print("{} --> {}".format(a,b))
        print("{} --> {}".format(b,c))
        return None
    hano(a,n - 1)
    print("{} --> {}".format(a,c))
    hano(b,a,n - 1)

hano(a,5)

A --> C
A --> B
B --> C
A --> C
B --> C
B --> A
A --> C
A --> C
B --> C
B --> A
A --> C
B --> C
A --> C
A --> B
B --> C
A --> C
B --> C
B --> A
A --> C
B --> C
A --> C
A --> B
B --> C
B --> C
A --> C
A --> B
B --> C
A --> C
B --> C
B --> A
A --> C

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!