- 汉诺塔问题
- 递归实现代码:
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
//汉诺塔问题 有64个盘子,A借助B移到C上,大盘子永远在下 1 A==>C 1
//2 A==>B A==>C B==>C 3
//3 A==>C A==>B C==>B A==>C B==>A B==>C A==>C 7
void Move(char pos1, char pos2)//递归实现
{
printf("%c-->%c\n", pos1, pos2);
}
void Hanoi(int n, char pos1, char pos2, char pos3)
{
if (1 == n)
{
Move(pos1, pos3);
}
else
{
Hanoi(n - 1, pos1, pos3, pos2);
Move(pos1, pos3);
Hanoi(n - 1, pos2, pos1, pos3);
}
}
int main()
{
Hanoi(3, 'A', ' B', 'C');
system("pause");
return 0;
}