def hannuo(n,a,b,c): if n == 1: print(a,"->",c) else: hannuo(n-1,a,c,b)#将最后一个盘子移到c print(a,"->",c)#将剩余的盘子移动c hannuo(n-1,b,a,c) n = int(input()) hannuo(n,"A","B","C")
python汉诺塔问题
原文：https://www.cnblogs.com/007abc/p/12609465.html
