把内容过程常用的内容片段记录起来,如下的内容内容是关于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);
}
else
{
hanoi(disks - 1, source, target, temp);
hanoi(1, source, temp, target);
hanoi(disks - 1, temp, source, 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 %cn", source, temp);
printf("move disk from %c to %cn", source, temp);
hanoi(i - 1, target, temp, source);
printf("move disk from %c to %cn", temp, target);
}
printf("move disk from %c to %cn", source, temp);
printf("move disk from %c to %cn", source, target);
}
int main()
{
int n;
printf("请输入盘数:");
scanf("%d", &n);
hanoi2colors(n);
return 0;
}