#include <stdio.h>
void hannuota(int n, char A, char B, char C)
{
/*
如果是1个盘子
直接将A柱子上的盘子从A移到C
否则
先将A柱子上的n-1个盘子借助C移到B
直接将A柱子上的盘子从A移到C
最后将B柱子上的n-1个盘子借助A移到C
*/
if (1 == n)
{
printf("将编号为%d的盘子直接从%c柱子移到%c柱子\n", n, A, C);
}
else
{
hannuota(n-1, A, C, B);
printf("将编号为%d的盘子直接从%c柱子移到%c柱子\n", n, A, C);
hannuota(n-1, B, A, C);
}
return ;
}
int main(int argc, const char * argv[])
{
char ch1 = 'A';
char ch2 = 'B';
char ch3 = 'C';
int n;
if(argc < 2)
{
n = 5;
}
else
{
n = atoi(argv[1]);
}
hannuota(n, 'A', 'B', 'C');
return 0;
}
Recursive application of the Tower of Hanoi in C
Guess you like
Origin blog.csdn.net/zxy131072/article/details/108489440
Ranking