汉诺塔

最新推荐文章于 2023-10-13 12:45:09 发布

轶拾柒.

最新推荐文章于 2023-10-13 12:45:09 发布

阅读量94

点赞数

分类专栏：代码

本文链接：https://blog.csdn.net/m0_56062592/article/details/115760439

版权

代码专栏收录该内容

17 篇文章 6 订阅

订阅专栏

 def hanoi(num, start_pos, end_pos, mid_pillar):
#     if num == 1:  # 边界条件
#         plate = start_pos[0].pop()
#         print('移动盘子 ' + str(plate) + ' 从 ' + start_pos[1] + ' 到 ' + end_pos[1])
#         end_pos[0].append(plate)
#     else:
#         hanoi(num - 1, start_pos, mid_pillar, end_pos)
#         plate = start_pos[0].pop()
#         print('移动盘子 ' + str(plate) + ' 从 ' + start_pos[1] + ' 到 ' + end_pos[1])
#         end_pos[0].append(plate)
#         hanoi(num - 1, mid_pillar, end_pos, start_pos)
#
#
# if __name__ == '__main__':
#     plate_nums = int(input("请输入盘子的数量："))
#     range_list = list(range(1, plate_nums + 1))
#     range_list.sort(reverse=True)
#     A = (range_list, 'A')
#     B = ([], 'B')
#     C = ([], 'C')
#     hanoi(plate_nums, A, C, B)

def hanoi(n, ch1, ch2, ch3):
    if n == 1:
        print(ch1, '->', ch3)
    else:
        hanoi(n - 1, ch1, ch3, ch2)
        print(ch1, '->', ch3)
        hanoi(n - 1, ch2, ch1, ch3)


plate_nums = int(input("请输入盘子的数量："))
hanoi(plate_nums, 'A', 'B', 'C')