汉诺塔问题递归解法

public class Hanoi {

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

public static void func(int n, String from, String mid, String to) {
if (n == 1) {
System.out.println("move from " + from + " to " + to);
} else {
func(n - 1, from, to, mid);
func(1, from, mid, to);
func(n - 1, mid, from, to);
}
}

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

}