汉诺塔(递归)
将1-N从A移动到B,C作为辅助
等价于:
1.1-N-1从A移动到C,B作为辅助
2.把N从A移动到B
3.把1-N从C移动到B,A为辅助
public class Main {
public static void main(String[] args) {
printHanoiTower(3,"A","B","C");
}
/*
* 将N个盘子从source移动到target的路径的打印
* N 初始的N个从小到达的盘子,N是最大编号
* from 原始柱子
* to 辅助的柱子
* help 目标柱子
* */
private static void printHanoiTower(int N, String from, String to,String help) {
if(N==1){
System.out.println("move "+N+" from "+from+" to "+to);
return;
}
printHanoiTower(N-1, from, help, to);//先把前N-1个盘子挪到辅助空间上去
System.out.println("move "+N+" from "+from+" to "+to);//N可以顺利到达target
printHanoiTower(N-1, help, to,from);//让N-1从辅助空间回到源空间上去
}
}