汉诺塔

package algorithm;

public class Hanoi {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		int n=3;
		doTowers(n,'A','B','C');
		
	}

	private static void doTowers(int n, char from, char inter, char to) {
		// TODO Auto-generated method stub
		if(n==1)
			System.out.println("disk1 from " +from+" to "+to);
		else
		{
			doTowers(n-1,from,to,inter); //把n-1个盘子从from放到inter上
			System.out.println("disk "+n+" from "+from+ " to "+to);
			doTowers(n-1,inter,from,to);//把n-1个盘子
		}
	}

}