用java实现汉诺塔的程序是啥呀?
1个回答
展开全部
其实不知道你到底是想要代码还是要什么
给你帖的示范代码吧:
汉诺塔问题的递归Java语言实现
public class Hanoi {/** * * @param n * 盘子的数目 * @param origin * 源座 * @param assist * 辅助座 * @param destination * 目的座 */ public void hanoi(int n, char origin, char assist, char destination) { if (n == 1) { move(origin, destination); } else { hanoi(n - 1, origin, destination, assist); move(origin, destination); hanoi(n - 1, assist, origin, destination); } } // Print the route of the movement private void move(char origin, char destination) { System.out.println("Direction:" + origin + "--->" + destination); } public static void main(String[] args) { Hanoi hanoi = new Hanoi(); hanoi.hanoi(3, 'A', 'B', 'C'); } }
给你帖的示范代码吧:
汉诺塔问题的递归Java语言实现
public class Hanoi {/** * * @param n * 盘子的数目 * @param origin * 源座 * @param assist * 辅助座 * @param destination * 目的座 */ public void hanoi(int n, char origin, char assist, char destination) { if (n == 1) { move(origin, destination); } else { hanoi(n - 1, origin, destination, assist); move(origin, destination); hanoi(n - 1, assist, origin, destination); } } // Print the route of the movement private void move(char origin, char destination) { System.out.println("Direction:" + origin + "--->" + destination); } public static void main(String[] args) { Hanoi hanoi = new Hanoi(); hanoi.hanoi(3, 'A', 'B', 'C'); } }
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询