Java写汉诺塔（递归）

題目內容:

有三根柱子A,B,C，在第一根柱子上有n个盘子，从上到下按照由小变大的顺序，现在要以B为中介，把盘子全部移动到C上。要求：在移动的过程中一次只能移动一个盘子并且，盘子下面要么是比它大的盘子要不就没有盘子。从键盘获取盘子的数量，并把移动时候的策略输出。

输入输出说明:

输入：
3
输出：
frome A move 1 to C
frome A move 2 to B
frome C move 1 to B
frome A move 3 to C
frome B move 1 to A
frome B move 2 to C
frome A move 1 to C

import java.util.Scanner;;

class HanoiTower{
    public static void move(int n,String frome,String to){
    	System.out.print("frome "+frome+" move "+n+" to "+to+"\n");
    }
    public static void moveDish(int level,String frome,String inter,String to){
	//write code here
    if(level==1)
    		move(1,frome,to);
    else{
    	moveDish(level-1,frome,to,inter);
    	move(level,frome,to);
    	moveDish(level-1,inter,frome,to);
    }
	}
}
public class Main {
    public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		//write code here
        int n = scan.nextInt();
		HanoiTower.moveDish(n, "A", "B", "C");
	}
}