public class test{
public static void main(String[] args) {
HanoiTower hTower = new HanoiTower();
hTower.move(3, 'A', 'B', 'C');
}
}
class HanoiTower{
public void move(int num, char a, char b, char c) { //num表示移动的圆盘个数,a、b、c表示三个塔
if(num == 1) {
System.out.println(a + "->" + c);
} else {
move(num - 1, a, c, b);
System.out.println(a + "->" + c);
move(num - 1, b, a, c);
}
}
}
java递归解决汉诺塔问题
最新推荐文章于 2024-07-24 17:27:32 发布