该楼层疑似违规已被系统折叠 隐藏此楼查看此楼
/*
*用递归来实现汉诺塔问题
*/
public class TowersOfHanoi
{
//塔的层数
private int totalDisks;
//塔的层数初始化
public TowersOfHanoi (int disks)
{
this.totalDisks = disks;
}
public void solve ()
{
moveTower (totalDisks, 1, 3, 2);
}
private void moveTower (int numDisks, int start, int end, int temp)
{
if (numDisks == 1)
moveOneDisk (start, end);
else
{
moveTower (numDisks-1, start, temp, end);
moveOneDisk (start, end);
moveTower (numDisks-1, temp, end, start);
}
}
//打印移动的路径
private void moveOneDisk (int start, int end)
{
System.out.println ("Move one disk from " + start + " to " + end);