#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
int a[10][3] = { 0 };
void show(int a[10][3]);//显示的作用
void hanno(int n, char A, char B, char C);//移动的过程,控制control
void move(char X, char Y);//移动,链接数据,视图
void show(int a[10][3])
{
printf("%5c%5c%5c\n", 'A', 'B', 'C');
printf("=======================\n");
for (int i = 0; i < 10; ++i)
{
for (int j = 0; j < 3; ++j)
{
printf("%5d", a[i][j]);
}
printf("\n");
}
}
void hanno(int n, char A, char B, char C)
{
if (n<1)
{
return;
}
else if (n==1)
{
printf("\n%c->%c", A, C);//直接
move(A, C);
show(a);
}
else
{
//N
hanno(n - 1, A, C, B);
printf("\n%c->%c", A, C);//直接
move(A, C);
show(a);
hanno(n - 1, B, A, C);
}
}
void move(char X, char Y)
{
int m = X - 65; //[9][m]
int n = Y - 65; //[9][n]
int imove = -1;
for (int i = 0; i < 10; i++)
{
if (a[i][m]!=0) //找到第一个不为0的数
{
imove = i;
break;
}
}
//a[imove][m]
int jmove;
if (a[9][n]==0)
{
jmove = 9;
}
else
{
jmove = 10;
for (int i = 0; i < 10; i++)
{
if (a[i][n]!=0)
{
jmove = i;
break;
}
}
jmove -= 1;
}
//交换数据
int temp = a[imove][m];
a[imove][m] = a[jmove][n];
a[jmove][n] = temp;
}
void main()
{
int n = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
a[10 - 1 - i][0] = n - i;//布局
}
show(a);
hanno(n, 'A', 'B', 'C');
system("pause");
}
IDE:Visual Studio2017
C语言实现汉诺塔算法
最新推荐文章于 2024-03-10 15:03:44 发布