经典算法10--汉诺塔

1双色汉诺塔

代码

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

void hanoi2colors(int disks)
{
    char source = 'A';
    char temp = 'B';
    char target = 'C';
    int i;
    for(i = disks / 2; i > 1; i--)
    {
        hanoi(i - 1, source, temp, target);
        printf("move disk from %c to %c \n", source, temp);
        printf("move disk from %c to %c \n", source, temp);
        hanoi(i - 1, target, temp, source);
        printf("move disk from %c to %c \n", temp, target); 
    }
    printf("move disk from %c to %c \n", source, temp);
    printf("move disk from %c to %c \n", source, target);
}

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

2.三色汉诺塔

#include <stdio.h>
void hanoi(int disks, char source, char temp, char target)
{
    if(disks == 1)
    {
        printf("move disk from %c to %c \n", source ,target);
        printf("move disk from %c to %c \n", source ,target);
        printf("move disk from %c to %c \n", 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 %c \n", source , temp);
        printf("move disk from %c to %c \n", source , temp);
        printf("move disk from %c to %c \n", source , target);
        printf("move disk from %c to %c \n", temp , target);
        printf("move disk from %c to %c \n", temp , source);
        printf("move disk from %c to %c \n", target , temp);
    }
    else
    {
        hanoi(disks / 3 - 1, source, temp, target);
        printf("move disk from %c to %c \n", source, temp);
        printf("move disk from %c to %c \n", source, temp);
        printf("move disk from %c to %c \n", source, temp);      
        hanoi(disks / 3 - 1, target, temp, source);
        printf("move disk from %c to %c \n", temp , target);
        printf("move disk from %c to %c \n", temp , target);
        printf("move disk from %c to %c \n", temp , target);      
        hanoi(disks / 3 - 1, source, target, temp);
        printf("move disk from %c to %c \n", target , temp);
        printf("move disk from %c to %c \n", target , temp);   
        hanoi(disks / 3 - 1, temp, source, target);
        printf("move disk from %c to %c \n", 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 %c \n", target, source);
            printf("move disk from %c to %c \n", target, source);
            if(i > 1)
            {
                hanoi(i - 1, temp, source, target);
            }
            printf("move disk from %c to %c \n", source, temp);
        }
    }
}

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

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值