汉诺塔java

汉诺塔算法
将所有的圆盘从最左侧杆移到最右侧杆，借助中间的杆

public class Hanoi {
    private static void hanoi(int n){
        if (n>0){
            func(n, n,  "left" , "right", "mid");
        }
    }

    private static void func(int i, int j, String left, String right, String mid) {
        if (i == 1){
            System.out.println("move " + j + " from " + left + " to " + right);
        } else {
            func(i-1, j-1, left, mid, right);
            System.out.println("move " + j + " from " + left + " to " + right);
            func(i-1, j-1, mid, right, left);
        }
    }


    public static void main(String[] args) {
        int n = 3;
        hanoi(n);
    }
}