汉诺塔问题

练习内容

# 汉诺塔问题的递归解法\ndef hanoi(n, source, target, auxiliary):\n if n == 1:\n print(f"移动盘子 1 从 {source} 到 {target}")\n return\n\n # 将n-1个盘子从源柱移到辅助柱\n hanoi(n - 1, source, auxiliary, tar