递归解决汉诺塔问题
public class Test4{
public static void move(char ps1,char ps2){
System.out.println(ps1+"==>"+ps2);
}
public static void hanioc(int n,char ps1,char ps2,char ps3){
if(n==1){
move(ps1,ps2);
}
else {
hanioc(n-1,ps1,ps3,ps2);
move(ps1,ps3);
hanioc(n-1,ps2,ps1,ps3);
}
}
public static void main(String[] args) {
hanioc(1,'A','B','C');
System.out.println("================");
hanioc(2,'A','B','C');
System.out.println("================");
hanioc(3,'A','B','C');
System.out.println("================");
hanioc(4,'A','B','C');
}
}