其实算法非常简单，当盘子的个数为n时，移动的次数应等于2^n

//简单到不能再简单的递归实现
#include<stdio.h>

void hano(int n,char A,char B,char C)
{
     //终止条件
    if(n==1)
    {
       printf("Move disk %d from %c to %c 
",n,A,C);
     }     
    else
    {
       hano(n-1,A,C,B);
       printf("Move disk %d  from  %c to%c 
",n,A,C);
       hano(n-1,B,A,C);
    }
}