/************************************************************
* 2.1 遞歸和分治策略 [例2.6]漢諾塔問(wèn)題
*/
public class Hanoi {
public static void hanoi(int n, int a, int b, int c) {
if (n > 0) {
hanoi(n - 1, a, c, b);
move(a, b);
hanoi(n - 1, c, b, a);
}
}
private static void move(int a, int b) {
// TODO Auto-generated method stub
}
}
聯(lián)系客服