汉诺塔移动的对称性(已解决)

void move(char x,char y)

                {

                   int i;

                   if(x=='A'&&y=='B')  i=1;

                      else

                            {

                             if(x=='A'&&y=='C')  i=2;

                                 else

                                      {

                                         if(x=='B'&&y=='C')  i=3;

                                            else

                                                    {

                                                       if(x=='B'&&y=='A')  i=4;

                                                           else

                                                                  {

                                                                       if(x=='C'&&y=='A')  i=5;

                                                                          else

                                                                               {

                                                                                   if(x=='C'&&y=='B')  i=6;

                                 

                                                                                 }

                            

                                                                     }

                                                      }  

                                         }

                             }

                   printf("%d",i);

                 }

void hanoi(int n, char one, char two, thar three)

                 {

                   if (n==1)move(one,three);

                       else

                              {

                                hanoi(n-1,one,three,two);

                                 move(one,three);

                                 hanoi(n-1,two,one,three);

                               }

                   }

 

main()

{

  int m;

  printf("/ninput the number of diskes:");

  scanf("%d",&m);

  printf("The step to moving %3d disks:/n",m);

  hanoi(m,'A','B','C');

}

 

前5个输出的结果如下图所示:

 

                              2

                            123

                        2162432

                123156123453123

2162432165462162432465432162432

 

2

123

2162432

123156123453123

2162432165462162432465432162432

123156123453123156153456123156123453123456153453123156123453123

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值