java汉诺塔问题

汉诺塔分为三个大步骤：

1.A柱的(n-1)个盘子从A经C到B；

2.A柱的第n个盘子从A直接到C；

3.B柱的(n-1)个盘子从B经A到C;

class HanoiTower{

public static void move(int n,String frome,String to)
{
System.out.println("frome "+frome+" move "+n+" to "+to);
}

    public static void moveDish(int level,String frome,String inter,String to){
  if(level==0)
        System.out.println("NULL");
  else if(level==1)
  move(level,frome,to);
  else
  {
  moveDish(level-1,frome,to,inter);// (n-1)个盘子从A经C到B;

  move(level,frome,to);                    //    第n个盘子从A到C;

  moveDish(level-1,inter,frome,to);   //  (n-1)个盘子从B经A到C;
  }
}
}
public class Main {
    public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
                int n=scan.nextInt();
HanoiTower.moveDish(n, "A", "B", "C");
}
}