递归实现汉诺塔

public class test{
	public static void main(String args[]){
		int n=12;//需要移动的个数
		moveto(12,'a','b','c');
	
	}
	public static void moveto(int n,char a,char b,char c){
		if(n==1){
			System.out.println(a+"->"+c);
		}
		else{
			moveto(n-1,a,c,b);
			System.out.println(a+"->"+c);
			moveto(n-1,b,a,c);
		}
	}
}