汉诺塔问题，有空再研究

来源：互联网发布：域名a记录查询编辑：程序博客网时间：2024/05/16 09:29
#include <stdio.h>void Hanoi(int n, char a, char b, char c);void Move(int n, char a, char b);int main(){    int n;    printf("Input the number of disks:");    scanf("%d", &n);    printf("Steps of moving %d disks from A to B by means of C:\n", n);    Hanoi(n, 'A', 'B', 'C'); /*调用递归函数Hanoi()将n个圆盘借助于C由A移动到B*/    return 0;}/* 函数功能：用递归方法将n个圆盘借助于柱子c从源柱子a移动到目标柱子b上 */void Hanoi(int n, char a, char b, char c){    if (n == 1)    {        Move(n, a, b);       /* 将第n个圆盘由a移到b */    }    else    {        Hanoi(n - 1, a, c, b); /* 递归调用Hanoi()，将第n-1个圆盘借助于b由a移动到c*/        Move(n, a, b);       /* 第n个圆盘由a移到b */        Hanoi(n - 1, c, b, a); /*递归调用Hanoi()，将第n-1个圆盘借助于a由c移动到b*/    }}/* 函数功能：  将第n个圆盘从源柱子a移到目标柱子b上 */void Move(int n, char a, char b){    printf("Move %d: from %c to %c\n", n, a, b);}/*void move(int n, char a, char b, char c);int main(){    int n;    printf("请输入要移动的块数：");    scanf("%d", &n);    printf("Steps of moving %d disks from A to B by means of C:\n", n);    move(n,'A','C','B');    return 0;}void move(int n, char a, char b, char c){    if(n == 1)    {        printf("Move 1:");        printf("from %c to %c\n", a, c);    //当n只有1个的时候直接从A移动到C    }    else    {        move(n-1, a, c, b);            //第n-1个要从A通过C移动到B        printf("from %c to %c\n", a, c);        move(n-1, b, a, c);            //n-1个移动过来之后B变开始盘，b通过A移动到C，这边很难理解    }}*/
0 0