Java 数据结构与算法系列精讲之汉诺塔

public class 汉诺塔 {

    // 汉诺塔实现
    private static void hanoi(int num, char a, char b, char c) {
        String str = "";

        // 判断是否为最后
        if(num==1) {
            str = "盘1从: " + a + "->" + c;
            System.out.println(str);
        } else {

            // 2^(n-1)次, 把除第n个盘从A移动到B
            hanoi(num - 1, a, c, b);

            str = "盘" + num + "从: " + a + "->" + c;
            System.out.println(str);

            // 2^(n-1)次, 把除第n个盘从B移动到C
            hanoi(num - 1, b, a, c);
        }
    }

    // main
    public static void main(String[] args) {
        hanoi(3, 'A', 'B', 'C');
    }
}