问题:求汉洛塔游戏的步骤 //记:f(n,"A","B","C")表示n个盘子从A柱子上移到C柱子上,借用B柱子的过程 //f(要移动的盘子的个数,起点,辅助柱子,终点) // 1.基本情况(直接能求):f(1,"A","B","C") // f(n-1,"A","C","B") // println(s"$A -----> $C") // f(n-1,"B","A","C") def han(n: Int, A: String, B: String, C: String): Unit = { if (n == 1) { println(s"$A --->$C") } else { han(n - 1, A, C, B) println(s"$A ---> $C") han(n - 1, B, A, C) } }
def main(args: Array[String]): Unit = {
han(3, "A", "B", "C")