汉诺塔--递归经典算法
public class HanoiTower {
public static void moveDish(int level, char from, char inter, char to) {
if (level == 1) {
System.out.println("从" + from + "塔将"+ "1号盘移动到" + to+"塔");
} else {
moveDish(level - 1, from, to, inter);
System.out.println("从" + from + "塔将" + level + "号盘移动到" + to+"塔");
moveDish(level - 1, inter, from, to);
}
}
public static void main(String[] args) {
int nDisks = 3;
moveDish(nDisks, 'A', 'B', 'C');
}
}