漢諾塔問題的java算法實作

         最近在當家教，順便下複習大一的内容，項目可以做，但是基礎還是得紮實。

         漢諾塔問題是遞歸思想優越性的最權威證明啦。

public class TowerOfHanoi {

	public static void main(String[] args) {
		Scanner inputScanner=new Scanner(System.in);
		System.out.println("請輸入盤子的個數");
		int n=inputScanner.nextInt();
		System.out.println("The moves are :");
		moveDisk(n,'A','B','C');
	}

	private static void moveDisk(int n, char fromTower, char toTower, char auxTower) {

		if(n==1)
			System.out.println("Move disk 1 from "+fromTower+" to "+toTower);
		else {
			moveDisk(n-1, fromTower, auxTower, toTower);
			System.out.println("Move disk "+n+" from "+fromTower+" to "+toTower);
			moveDisk(n-1,auxTower , toTower, fromTower);
		}
		
	}

}