typescript/school/hanoi.ts · 457 字节 · 下载原文
// 汉诺塔 —— 经典递归练习(打印移动步骤)
// Towers of Hanoi -- the classic recursion exercise
//
// 来源 / Source: Rosetta Code「Towers of Hanoi」JavaScript 条目(GFDL 1.2 / CC-BY-SA 3.0)
function move(n: number, a: string, b: string, c: string): void {
if (n > 0) {
move(n - 1, a, c, b);
print_str("Move disk from " + a + " to " + c + "\n");
move(n - 1, b, a, c);
}
}
move(4, "A", "B", "C");