汉诺塔游戏《算法很美》

汉诺塔

public class 汉诺塔游戏 {
    public static void main(String[] args){
        printHanoiTower(3,"A","B","C");
    }

    static void printHanoiTower(int N, String from, String to, String help){
        if (N==1){
            System.out.println("move " + N + "from" + from + "to" + to);
            return;
        }

        printHanoiTower(N-1, from, help, to); //下把前N-1个盒子挪到辅助空间上去
        System.out.println("move" + N + "from" + from + "to" + to);  //N可以顺利到达target
        printHanoiTower(N-1, help, to, from);  //让N-1从辅助空间回到源空间上去


    }
}

printHanoiTower(N-1, from, help, to); 其实就是把N-1个盒子挪到C

 printHanoiTower(N-1, help, to, from); 就是将本来在C的盒子通过A移动到B