CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-16 19:11:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Prepare 1.0.0 release (#1044)

Browse Source 
* Update the book with the thrid revised edition

* Fix a typo

* Update the contributors' information

* Update the mindmap

* Update the version number
This commit is contained in:
Yudong Jin
2024-01-14 03:16:20 +08:00
committed by GitHub
parent b9ae4ffe9a
commit f6976978dd
33 changed files with 50 additions and 49 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -8,7 +8,7 @@
#define MAX_SIZE 100
/* 回溯算法：N 皇后 */
/* 回溯算法：n 皇后 */
void backtrack(int row, int n, char state[MAX_SIZE][MAX_SIZE], char ***res, int *resSize, bool cols[MAX_SIZE],
bool diags1[2 * MAX_SIZE - 1], bool diags2[2 * MAX_SIZE - 1]) {
// 当放置完所有行时，记录解
@@ -40,7 +40,7 @@ void backtrack(int row, int n, char state[MAX_SIZE][MAX_SIZE], char ***res, int
}
}
/* 求解 N 皇后 */
/* 求解 n 皇后 */
char ***nQueens(int n, int *returnSize) {
char state[MAX_SIZE][MAX_SIZE];
// 初始化 n*n 大小的棋盘，其中 'Q' 代表皇后，'#' 代表空位