汉诺塔游戏求解

来源:互联网 发布:记忆力软件训练 编辑:程序博客网 时间:2024/06/05 17:34


HanoiTowers.java

/** * 汉诺塔游戏求解**/class HanoiTowers{public static void main(String[] args){solve(3, "A", "B", "C");}//递归方法对汉诺塔游戏求解public static void solve(int numberOfDisks, String startPole, String tempPole, String endPole){if(numberOfDisks == 1){System.out.println("The Disk " + numberOfDisks + " move: " + startPole + " ----> " + endPole);}else{solve(numberOfDisks-1, startPole, endPole, tempPole);System.out.println("The Disk " + numberOfDisks + " move: " + startPole + " ----> " + endPole);solve(numberOfDisks-1, tempPole, startPole, endPole);}}}


0 0