function hanoi($n, $start, $end, $temp) { if ($n === 1) { echo "Move disk 1 from $start to $end\n"; } else { hanoi($n - 1, $start, $temp, $end); echo "Move disk $n from $start to $end\n"; hanoi($n - 1, $temp, $end, $start); }}$n = 3; // 汉诺塔的层数hanoi($n, 'A', 'C', 'B');输出：
Move disk 1 from A to C
Move disk 2 from A to B
Move disk 1 from C to B
Move disk 3 from A to C
Move disk 1 from B to A
Move disk 2 from B to C
Move disk 1 from A to C
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容，请发送邮件至 55@qq.com 举报，一经查实，本站将立刻删除。转转请注明出处：https://www.szhjjp.com/n/1008429.html
