[Java]-漢諾塔

遞歸最重要的兩個部分就是邊界範圍和遞歸體！這裏的邊界範圍就是n==1的時候

漢諾塔動態演示

三個漢諾塔圖解：

代碼實現：

public class MainClass {
    public static void main(String[] args) {
        int nDisks = 3;
        doTowers(nDisks, 'A', 'B', 'C');
    }
    public static void doTowers(int topN, char from, char inter, char to) {
        if (topN == 1){
            System.out.println("Disk 1 from "
            + from + " to " + to);
        }else {
            doTowers(topN - 1, from, to, inter);
            System.out.println("Disk "
            + topN + " from " + from + " to " + to);
            doTowers(topN - 1, inter, from, to);
        }
    }
}