// 汉诺塔问题的递归解法 function hanoi(n, source, target, auxiliary) { if (n === 1) { console.log(`移动盘子 1 从 ${source} 到 ${target}`); return; } hanoi(n - 1, source, auxiliary, target