问题分三步:
1.
将前n-1个盘子放到中间
2.
将第n个盘子放到右边
3.
将前n-1个盘子放到右边
public static void Hanoi(int n,char from,char in,char to) {
if(n == 1) {
System.out.println(“把第1个盘子从”+from+“移动到”+to);
}else {
Hanoi(n-1, from, to, in);
System.out.println(“第”+n+“个盘子”+from+“移动到”+to);
Hanoi(n-1, in, from, to);
}
}