递归(1)

汉诺塔

/**
 * 汉诺塔A为起始 B为依赖 C为目标
 * @author lenovo
 *
 */
public class HanNota {
    private int i=1;
    //n个盘子从A借助B挪到C==
    public void hanNota(int n,char from,char dependOn,char to){
        if(n==1){
            move(1,from,to);
        }else{
            hanNota(n-1,from,to,dependOn);//n-1个盘子依靠从A借助c移到B
            move(n,from,to);//将最大的盘子移到C
            hanNota(n-1,dependOn,from,to);//n-1个盘子从B借助A移到C
        }
    }
    public void move(int n,char from,char to){
        System.out.println("第"+(i++)+"步从"+from+"----->"+to);
    }
    
    public static void main(String[] args) {
        HanNota hanNota = new HanNota();
        hanNota.hanNota(3, 'A', 'B', 'C');
    }

}