使用递归函数解决PHP中的汉诺塔问题

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 CMove disk 2 from A to BMove disk 1 from C to BMove disk 3 from A to CMove disk 1 from B to AMove disk 2 from B to CMove disk 1 from A to C