递归
代码中包含汉诺塔解答思路
#include<stdio.h>
long recursion(int n);
void move(char x, char y);
void hanoi(int n, char one, char two, char three);
void main()
{
int m;
printf("请输入有盘子的个数:");
scanf_s("%d",&m);
hanoi(m, 'A', 'B', 'C');
}
long recursion(int n)
{
long temp_res;
if (n < 0)
printf("n<0,输入错误\n");
else if (n == 0 || n == 1)
temp_res = 1;
else
temp_res = recursion(n - 1) * n;
return temp_res;
}
void move(char x, char y)
{
printf("%c-->%c\n",x,y);
}
void hanoi(int n, char one, char two, char three)
{
void move(char x, char y);
if (n == 1)
move(one, three);
else
{
hanoi(n - 1, one, three, two);
move(one, three);
hanoi(n - 1, two, one, three);
}
}