C语言经典算法 - 三色河内塔的代码

如下的内容内容是关于C语言经典算法 - 三色河内塔的内容。

#include <stdio.h>
void hanoi(int disks, char source, char temp, char target)
{
  if (disks == 1)
  {
    printf("move disk from %c to %cn", source, target);
    printf("move disk from %c to %cn", source, target);
    printf("move disk from %c to %cn", source, target);
  }
  else
  {
    hanoi(disks - 1, source, target, temp);
    hanoi(1, source, temp, target);
    hanoi(disks - 1, temp, source, target);
  }
}

void hanoi3colors(int disks)
{
  char source = 'A';
  char temp = 'B';
  char target = 'C';
  int i;
  if (disks == 3)
  {
    printf("move disk from %c to %cn", source, temp);
    printf("move disk from %c to %cn", source, temp);
    printf("move disk from %c to %cn", source, target);
    printf("move disk from %c to %cn", temp, target);
    printf("move disk from %c to %cn", temp, source);
    printf("move disk from %c to %cn", target, temp);
    ;
  }
  else
  {
    hanoi(disks / 3-1, source, temp, target);
    printf("move disk from %c to %cn", source, temp);
    printf("move disk from %c to %cn", source, temp);
    printf("move disk from %c to %cn", source, temp);
    hanoi(disks / 3-1, target, temp, source);
    printf("move disk from %c to %cn", temp, target);
    printf("move disk from %c to %cn", temp, target);
    printf("move disk from %c to %cn", temp, target);
    hanoi(disks / 3-1, source, target, temp);
    printf("move disk from %c to %cn", target, source);
    printf("move disk from %c to %cn", target, source);
    hanoi(disks / 3-1, temp, source, target);
    printf("move disk from %c to %cn", source, temp);
    for (i = disks / 3-1; i > 0; i--)
    {
      if (i > 1)
      {
        hanoi(i - 1, target, source, temp);
      }
      printf("move disk from %c to %cn", target, source);
      printf("move disk from %c to %cn", target, source);
      if (i > 1)
      {
        hanoi(i - 1, temp, source, target);
      }
      printf("move disk from %c to %cn", source, temp);
    }
  }
}

int main()
{
  int n;
  printf("请输入盘数:");
  scanf("%d", &n);
  hanoi3colors(n);
  return 0;
}

转载于:https://blog.51cto.com/14137494/2372737

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值