CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 11:59:46 +08:00
Code Issues Packages Projects Releases Wiki Activity

Simplify struct declarations of C.

Browse Source 
Use PascalCase for all structs in C.
SImplify n_queens.c
Format C code for chapter of graph.
This commit is contained in:
krahets
2023-10-18 02:16:26 +08:00
parent 070d23ee6e
commit 1e49574332
35 changed files with 503 additions and 599 deletions
Download Patch File Download Diff File Expand all files Collapse all files

52
codes/c/chapter_backtracking/n_queens.c
View File

@@ -9,25 +9,17 @@
#define MAX_N 100
#define MAX_RES 1000
/* 放置结果 */
struct result {
char ***data;
int size;
};
typedef struct result Result;
/* 回溯算法：N 皇后 */
void backtrack(int row, int n, char state[MAX_N][MAX_N], Result *res,
bool cols[MAX_N], bool diags1[2 * MAX_N - 1], bool diags2[2 * MAX_N - 1]) {
void backtrack(int row, int n, char state[MAX_N][MAX_N], char ***res, int *resSize, bool cols[MAX_N],
bool diags1[2 * MAX_N - 1], bool diags2[2 * MAX_N - 1]) {
// 当放置完所有行时，记录解
if (row == n) {
res->data[res->size] = (char **)malloc(sizeof(char *) * n);
res[*resSize] = (char **)malloc(sizeof(char *) * n);
for (int i = 0; i < n; ++i) {
res->data[res->size][i] = (char *)malloc(sizeof(char) * (n + 1));
strcpy(res->data[res->size][i], state[i]);
res[*resSize][i] = (char *)malloc(sizeof(char) * (n + 1));
strcpy(res[*resSize][i], state[i]);
}
res->size++;
(*resSize)++;
return;
}
// 遍历所有列
@@ -41,7 +33,7 @@ void backtrack(int row, int n, char state[MAX_N][MAX_N], Result *res,
state[row][col] = 'Q';
cols[col] = diags1[diag1] = diags2[diag2] = true;
// 放置下一行
backtrack(row + 1, n, state, res, cols, diags1, diags2);
backtrack(row + 1, n, state, res, resSize, cols, diags1, diags2);
// 回退：将该格子恢复为空位
state[row][col] = '#';
cols[col] = diags1[diag1] = diags2[diag2] = false;
@@ -50,7 +42,7 @@ void backtrack(int row, int n, char state[MAX_N][MAX_N], Result *res,
}
/* 求解 N 皇后 */
Result *nQueens(int n) {
char ***nQueens(int n, int *returnSize) {
char state[MAX_N][MAX_N];
// 初始化 n*n 大小的棋盘，其中 'Q' 代表皇后，'#' 代表空位
for (int i = 0; i < n; ++i) {
@@ -63,26 +55,26 @@ Result *nQueens(int n) {
bool diags1[2 * MAX_N - 1] = {false}; // 记录主对角线是否有皇后
bool diags2[2 * MAX_N - 1] = {false}; // 记录副对角线是否有皇后
Result *res = malloc(sizeof(Result));
res->data = (char ***)malloc(sizeof(char **) * MAX_RES);
res->size = 0;
backtrack(0, n, state, res, cols, diags1, diags2);
char ***res = (char ***)malloc(sizeof(char **) * MAX_RES);
*returnSize = 0;
backtrack(0, n, state, res, returnSize, cols, diags1, diags2);
return res;
}
/* Driver Code */
int main() {
int n = 4;
Result *res = nQueens(n);
int returnSize;
char ***res = nQueens(n, &returnSize);
printf("输入棋盘长宽为%d\n", n);
printf("皇后放置方案共有 %d 种\n", res->size);
for (int i = 0; i < res->size; ++i) {
printf("皇后放置方案共有 %d 种\n", returnSize);
for (int i = 0; i < returnSize; ++i) {
for (int j = 0; j < n; ++j) {
printf("[");
for (int k = 0; res->data[i][j][k] != '\0'; ++k) {
printf("%c", res->data[i][j][k]);
if (res->data[i][j][k + 1] != '\0') {
for (int k = 0; res[i][j][k] != '\0'; ++k) {
printf("%c", res[i][j][k]);
if (res[i][j][k + 1] != '\0') {
printf(", ");
}
}
@@ -92,13 +84,13 @@ int main() {
}
// 释放内存
for (int i = 0; i < res->size; ++i) {
for (int i = 0; i < returnSize; ++i) {
for (int j = 0; j < n; ++j) {
free(res->data[i][j]);
free(res[i][j]);
}
free(res->data[i]);
free(res[i]);
}
free(res->data);
free(res);
return 0;
}