0
点赞
收藏
分享

微信扫一扫

Hanoi塔问题题解

云竹文斋 2022-02-21 阅读 81
#include<cstdio>
void hanio(int n,char a,char b,char c);
int main(void)
{
    int n;
    printf("input the number of disk:");
    scanf("%d",&n);
    printf("the steps for %d disk are:\n",n);
    hanio(n,'a','b','c');
    return 0;
}
void hanio(int n,char a,char b,char c){
    if(n==1)
        printf("%c-->%c\n",a,b);
    else{
        hanio(n-1,a,c,b);
        printf("%c-->%c\n",a,b);
        hanio(n-1,c,b,a);
    }
}
举报

相关推荐

0 条评论