Hanoi递归实现
package com.hb.hanoi;
public class Hanoi {
private static int step =1;
private static int moveTime = 0;
public static void hanoi(int n, char A, char B, char C) {
if (n == 1) {
move(n, A, C);
} else {
hanoi(n - 1, A, C, B);
move(n, A, C);
hanoi(n - 1, B, A, C);
}
}
public static void move(int m, char A, char B) {
System.out.println("第"+(step++)+"步："+"将圆盘" + m + "从" + A + "移到" + B);
moveTime++;
}
public static void main(String[] args) {
Hanoi.hanoi(3, 'A', 'B', 'C');
System.out.println("Hanoi问题搞定！");
System.out.println("总共移动"+moveTime+"次,好累啊！");
}
}
来自 “ ITPUB博客 ” ，链接：https://blog.itpub.net/9474419/viewspace-478429/ ，如需转载，请注明出处，否则将追究法律责任。
