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