如下的内容内容是关于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