Java汉诺塔算法

/**
 * Created by Enzo Cotter on 2018/12/5.
 */
public class Integer {
    public static void main(String[] args){

        hanoi(3,'A','B','C');
    }
    public static void hanoi(int n,char a,char b,char c){
        if(n == 1)
        {
            System.out.println("Disk 1 from " + a + " to " + c);
        }
        else {
            hanoi(n-1,a,c,b);   //把第n-1块从A移到B，经C中转
            System.out.println("Disk " + n + " from " + a + " to " + c);    //把第n块从A移到C
            hanoi(n-1,b,a,c);   //把第n-1块从B移到C，经A中转
        }
    }
}