java汉诺塔问题_Java如何使用方法来解决汉诺塔问题？

在Java中&＃xff0c;如何使用方法来解决汉诺塔的问题&＃xff1f;

本示例显示了解决汉诺塔问题的方法(3个盘)。

package com.yiibai;

public class TowerOfHanoi {

public static void main(String[] args) {

int nDisks &＃61; 3;

doTowers(nDisks, &＃39;A&＃39;, &＃39;B&＃39;, &＃39;C&＃39;);

}

public static void doTowers(int topN, char from, char inter, char to) {

if (topN &＃61;&＃61; 1) {

System.out.println("Disk 1 from " &＃43; from &＃43; " to " &＃43; to);

} else {

doTowers(topN - 1, from, to, inter);

System.out.println("Disk " &＃43; topN &＃43; " from " &＃43; from &＃43; " to " &＃43; to);

doTowers(topN - 1, inter, from, to);

}

}

}

执行上面示例代码&＃xff0c;得到以下结果 -

Disk 1 from A to C

Disk 2 from A to B

Disk 1 from C to B

Disk 3 from A to C

Disk 1 from B to A

Disk 2 from B to C

Disk 1 from A to C

示例-2

以下是解决汉诺塔的另一个例子

package com.yiibai;

public class TowerOfHanoi2 {

public static void move(int n, int startPole, int endPole) {

if (n &＃61;&＃61; 0) {

return;

}

int intermediatePole &＃61; 6 - startPole - endPole;

move(n - 1, startPole, intermediatePole);

System.out.println("Move " &＃43; n &＃43; " from " &＃43; startPole &＃43; " to "

&＃43; endPole);

move(n - 1, intermediatePole, endPole);

}

public static void main(String[] args) {

move(5, 1, 3);

}

}

执行上面示例代码&＃xff0c;得到以下结果 -

Move 1 from 1 to 3

Move 2 from 1 to 2

Move 1 from 3 to 2

Move 3 from 1 to 3

Move 1 from 2 to 1

Move 2 from 2 to 3

Move 1 from 1 to 3

Move 4 from 1 to 2

Move 1 from 3 to 2

Move 2 from 3 to 1

Move 1 from 2 to 1

Move 3 from 3 to 2

Move 1 from 1 to 3

Move 2 from 1 to 2

Move 1 from 3 to 2

Move 5 from 1 to 3

Move 1 from 2 to 1

Move 2 from 2 to 3

Move 1 from 1 to 3

Move 3 from 2 to 1

Move 1 from 3 to 2

Move 2 from 3 to 1

Move 1 from 2 to 1

Move 4 from 2 to 3

Move 1 from 1 to 3

Move 2 from 1 to 2

Move 1 from 3 to 2

Move 3 from 1 to 3

Move 1 from 2 to 1

Move 2 from 2 to 3

Move 1 from 1 to 3

¥ 我要打赏

纠错/补充

收藏

加QQ群啦&＃xff0c;易百教程官方技术学习群

注意&＃xff1a;建议每个人选自己的技术方向加群&＃xff0c;同一个QQ最多限加 3 个群。