#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
//使用递归打印1个n层的汉诺塔从A柱到C柱的所有步骤
int main() {
void hanoi(int n, char A, char B, char C);
int n = 0;
printf("请输入n=");
scanf("%d", &n); //n表示汉诺塔层数
hanoi(n, 'A', 'B', 'C');
return 0;
}
void hanoi(int n,char A,char B,char C) { //A、B、C表示三个柱子
if (n == 1) {
printf("Move %d from %c to %c\n", n, A, C);
}else {
hanoi(n-1, A, C, B);
printf("Move %d from %c to %c\n", n, A, C);
hanoi(n-1, B, A, C);
}
}
汉诺(Hanoi)塔问题
最新推荐文章于 2024-08-12 19:18:27 发布