mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 03:56:28 +08:00
e720aa2d24
* Sync recent changes to the revised Word. * Revised the preface chapter * Revised the introduction chapter * Revised the computation complexity chapter * Revised the chapter data structure * Revised the chapter array and linked list * Revised the chapter stack and queue * Revised the chapter hashing * Revised the chapter tree * Revised the chapter heap * Revised the chapter graph * Revised the chapter searching * Reivised the sorting chapter * Revised the divide and conquer chapter * Revised the chapter backtacking * Revised the DP chapter * Revised the greedy chapter * Revised the appendix chapter * Revised the preface chapter doubly * Revised the figures
74 lines
2 KiB
C
74 lines
2 KiB
C
/**
|
|
* File: hanota.c
|
|
* Created Time: 2023-10-01
|
|
* Author: Zuoxun (845242523@qq.com), lucas(superrat6@gmail.com)
|
|
*/
|
|
|
|
#include "../utils/common.h"
|
|
|
|
// 假设最多有 1000 个排列
|
|
#define MAX_SIZE 1000
|
|
|
|
/* 移动一个圆盘 */
|
|
void move(int *src, int *srcSize, int *tar, int *tarSize) {
|
|
// 从 src 顶部拿出一个圆盘
|
|
int pan = src[*srcSize - 1];
|
|
src[*srcSize - 1] = 0;
|
|
(*srcSize)--;
|
|
// 将圆盘放入 tar 顶部
|
|
tar[*tarSize] = pan;
|
|
(*tarSize)++;
|
|
}
|
|
|
|
/* 求解汉诺塔问题 f(i) */
|
|
void dfs(int i, int *src, int *srcSize, int *buf, int *bufSize, int *tar, int *tarSize) {
|
|
// 若 src 只剩下一个圆盘，则直接将其移到 tar
|
|
if (i == 1) {
|
|
move(src, srcSize, tar, tarSize);
|
|
return;
|
|
}
|
|
// 子问题 f(i-1) ：将 src 顶部 i-1 个圆盘借助 tar 移到 buf
|
|
dfs(i - 1, src, srcSize, tar, tarSize, buf, bufSize);
|
|
// 子问题 f(1) ：将 src 剩余一个圆盘移到 tar
|
|
move(src, srcSize, tar, tarSize);
|
|
// 子问题 f(i-1) ：将 buf 顶部 i-1 个圆盘借助 src 移到 tar
|
|
dfs(i - 1, buf, bufSize, src, srcSize, tar, tarSize);
|
|
}
|
|
|
|
/* 求解汉诺塔问题 */
|
|
void solveHanota(int *A, int *ASize, int *B, int *BSize, int *C, int *CSize) {
|
|
// 将 A 顶部 n 个圆盘借助 B 移到 C
|
|
dfs(*ASize, A, ASize, B, BSize, C, CSize);
|
|
}
|
|
|
|
/* Driver Code */
|
|
int main() {
|
|
// 列表尾部是柱子顶部
|
|
int a[] = {5, 4, 3, 2, 1};
|
|
int b[MAX_SIZE] = {0};
|
|
int c[MAX_SIZE] = {0};
|
|
|
|
int ASize = sizeof(a) / sizeof(a[0]);
|
|
int BSize = 0;
|
|
int CSize = 0;
|
|
|
|
printf("\n初始状态下：");
|
|
printf("\nA = ");
|
|
printArray(a, ASize);
|
|
printf("B = ");
|
|
printArray(b, BSize);
|
|
printf("C = ");
|
|
printArray(c, CSize);
|
|
|
|
solveHanota(a, &ASize, b, &BSize, c, &CSize);
|
|
|
|
printf("\n圆盘移动完成后：");
|
|
printf("A = ");
|
|
printArray(a, ASize);
|
|
printf("B = ");
|
|
printArray(b, BSize);
|
|
printf("C = ");
|
|
printArray(c, CSize);
|
|
|
|
return 0;
|
|
}
|