n阶Hanoi塔问题

解题思路:

注意事项:

参考代码:

def hanoi(n, a, b, c, count):
   if n > 0:
       count = hanoi(n-1, a, c, b, count)
       print("%2d. Move disk %d from %c to %c" % (count+1, n, a, c))
       count += 1
       count = hanoi(n-1, b, a, c, count)
   return count


while True:
   try:
       n = int(input())  # 输入每组的阶数
       count = 0  # 移动次数的计数器
       count = hanoi(n, 'X', 'Y', 'Z', count)
       print()  # 输出空行
   except EOFError:
       break