Hanoi塔问题
设a、b、c是三个塔座。开始时,在塔座a上有一叠共n个圆盘,这些圆盘自下而上,由大到小地叠放在一起,各圆盘从小到大编号为1,2,3…,n。现要求将塔座a上n个圆盘移到c上,并按同样的顺序叠置。
public class Hanoi {
public static void main(String[] args) {
String a = "塔一";
String b = "塔二";
String c = "塔三";
hanoi(4, a, b, c);
}
static void hanoi(int n, Object a, Object b, Object c) {
if(n > 1) {
hanoi(n-1, a, c , b);
move(a, c);
hanoi(n-1, b, a, c);
}
}
static void move(Object a, Object b) {
System.out.println(a + "->" + b);
}
}