algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-03 05:27:55 +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/rust/chapter_backtracking/n_queens.rs
View File

@ -4,7 +4,7 @@
* Author: codingonion (coderonion@gmail.com)
*/
/* 回溯算法：N 皇后 */
/* 回溯算法：n 皇后 */
fn backtrack(row: usize, n: usize, state: &mut Vec<Vec<String>>, res: &mut Vec<Vec<Vec<String>>>,
cols: &mut [bool], diags1: &mut [bool], diags2: &mut [bool]) {
// 当放置完所有行时，记录解
@ -35,7 +35,7 @@ fn backtrack(row: usize, n: usize, state: &mut Vec<Vec<String>>, res: &mut Vec<V
}
}
/* 求解 N 皇后 */
/* 求解 n 皇后 */
fn n_queens(n: usize) -> Vec<Vec<Vec<String>>> {
// 初始化 n*n 大小的棋盘，其中 'Q' 代表皇后，'#' 代表空位
let mut state: Vec<Vec<String>> = Vec::new();