xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 09:26:28 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix several bugs

Browse source
This commit is contained in:
krahets 2023-10-17 23:45:31 +08:00
parent 51405c0669
commit 5392afd44b
14 changed files with 15 additions and 15 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
codes/c/chapter_backtracking/preorder_traversal_i_compact.c
View file

@ -15,7 +15,7 @@ void printFunc(vector *v, void *p) {
} }
/* 前序遍历：例题一 */ /* 前序遍历：例题一 */
static void preOrder(TreeNode *root) { void preOrder(TreeNode *root) {
if (root == NULL) { if (root == NULL) {
return; return;
} }

2
codes/c/chapter_divide_and_conquer/CMakeLists.txt
View file

@ -1,3 +1,3 @@
add_executable(binary_search_recur binary_search_recur.c) add_executable(binary_search_recur binary_search_recur.c)
add_executable(hanota hanota.c)
add_executable(build_tree build_tree.c) add_executable(build_tree build_tree.c)
add_executable(hanota hanota.c)

2
codes/c/chapter_hashing/hash_map_chaining.c
View file

@ -19,7 +19,7 @@ typedef struct pair Pair;
/* 链表节点 */ /* 链表节点 */
struct node { struct node {
Pair *pair; Pair *pair;
struct Node *next; struct node *next;
}; };
typedef struct node Node; typedef struct node Node;

2
codes/cpp/chapter_backtracking/permutations_i.cpp
View file

@ -16,7 +16,7 @@ void backtrack(vector<int> &state, const vector<int> &choices, vector<bool> &sel
// 遍历所有选择 // 遍历所有选择
for (int i = 0; i < choices.size(); i++) { for (int i = 0; i < choices.size(); i++) {
int choice = choices[i]; int choice = choices[i];
// 剪枝：不允许重复选择元素 且 不允许重复选择相等元素 // 剪枝：不允许重复选择元素
if (!selected[i]) { if (!selected[i]) {
// 尝试：做出选择，更新状态 // 尝试：做出选择，更新状态
selected[i] = true; selected[i] = true;

2
codes/csharp/chapter_backtracking/permutations_i.cs
View file

@ -17,7 +17,7 @@ public class permutations_i {
// 遍历所有选择 // 遍历所有选择
for (int i = 0; i < choices.Length; i++) { for (int i = 0; i < choices.Length; i++) {
int choice = choices[i]; int choice = choices[i];
// 剪枝：不允许重复选择元素 且 不允许重复选择相等元素 // 剪枝：不允许重复选择元素
if (!selected[i]) { if (!selected[i]) {
// 尝试：做出选择，更新状态 // 尝试：做出选择，更新状态
selected[i] = true; selected[i] = true;

2
codes/dart/chapter_backtracking/permutations_i.dart
View file

@ -19,7 +19,7 @@ void backtrack(
// 遍历所有选择 // 遍历所有选择
for (int i = 0; i < choices.length; i++) { for (int i = 0; i < choices.length; i++) {
int choice = choices[i]; int choice = choices[i];
// 剪枝：不允许重复选择元素 且 不允许重复选择相等元素 // 剪枝：不允许重复选择元素
if (!selected[i]) { if (!selected[i]) {
// 尝试：做出选择，更新状态 // 尝试：做出选择，更新状态
selected[i] = true; selected[i] = true;

2
codes/go/chapter_backtracking/permutations_i.go
View file

@ -14,7 +14,7 @@ func backtrackI(state *[]int, choices *[]int, selected *[]bool, res *[][]int) {
// 遍历所有选择 // 遍历所有选择
for i := 0; i < len(*choices); i++ { for i := 0; i < len(*choices); i++ {
choice := (*choices)[i] choice := (*choices)[i]
// 剪枝：不允许重复选择元素 且 不允许重复选择相等元素 // 剪枝：不允许重复选择元素
if !(*selected)[i] { if !(*selected)[i] {
// 尝试：做出选择，更新状态 // 尝试：做出选择，更新状态
(*selected)[i] = true (*selected)[i] = true

2
codes/java/chapter_backtracking/permutations_i.java
View file

@ -19,7 +19,7 @@ public class permutations_i {
// 遍历所有选择 // 遍历所有选择
for (int i = 0; i < choices.length; i++) { for (int i = 0; i < choices.length; i++) {
int choice = choices[i]; int choice = choices[i];
// 剪枝：不允许重复选择元素 且 不允许重复选择相等元素 // 剪枝：不允许重复选择元素
if (!selected[i]) { if (!selected[i]) {
// 尝试：做出选择，更新状态 // 尝试：做出选择，更新状态
selected[i] = true; selected[i] = true;

2
codes/javascript/chapter_backtracking/permutations_i.js
View file

@ -13,7 +13,7 @@ function backtrack(state, choices, selected, res) {
} }
// 遍历所有选择 // 遍历所有选择
choices.forEach((choice, i) => { choices.forEach((choice, i) => {
// 剪枝：不允许重复选择元素 且 不允许重复选择相等元素 // 剪枝：不允许重复选择元素
if (!selected[i]) { if (!selected[i]) {
// 尝试：做出选择，更新状态 // 尝试：做出选择，更新状态
selected[i] = true; selected[i] = true;

2
codes/rust/chapter_backtracking/permutations_i.rs
View file

@ -14,7 +14,7 @@ fn backtrack(mut state: Vec<i32>, choices: &[i32], selected: &mut [bool], res: &
// 遍历所有选择 // 遍历所有选择
for i in 0..choices.len() { for i in 0..choices.len() {
let choice = choices[i]; let choice = choices[i];
// 剪枝：不允许重复选择元素 且 不允许重复选择相等元素 // 剪枝：不允许重复选择元素
if !selected[i] { if !selected[i] {
// 尝试：做出选择，更新状态 // 尝试：做出选择，更新状态
selected[i] = true; selected[i] = true;

2
codes/swift/chapter_backtracking/permutations_i.swift
View file

@ -13,7 +13,7 @@ func backtrack(state: inout [Int], choices: [Int], selected: inout [Bool], res:
} }
// 遍历所有选择 // 遍历所有选择
for (i, choice) in choices.enumerated() { for (i, choice) in choices.enumerated() {
// 剪枝：不允许重复选择元素 且 不允许重复选择相等元素 // 剪枝：不允许重复选择元素
if !selected[i] { if !selected[i] {
// 尝试：做出选择，更新状态 // 尝试：做出选择，更新状态
selected[i] = true selected[i] = true

2
codes/typescript/chapter_backtracking/permutations_i.ts
View file

@ -18,7 +18,7 @@ function backtrack(
} }
// 遍历所有选择 // 遍历所有选择
choices.forEach((choice, i) => { choices.forEach((choice, i) => {
// 剪枝：不允许重复选择元素 且 不允许重复选择相等元素 // 剪枝：不允许重复选择元素
if (!selected[i]) { if (!selected[i]) {
// 尝试：做出选择，更新状态 // 尝试：做出选择，更新状态
selected[i] = true; selected[i] = true;

4
docs/chapter_array_and_linkedlist/list.md
View file

@ -233,9 +233,9 @@
```rust title="list.rs" ```rust title="list.rs"
/* 访问元素 */ /* 访问元素 */
let num: i32 = nums[1]; // 访问索引 1 处的元素 let num: i32 = nums[1]; // 访问索引 1 处的元素
/* 更新元素 */ /* 更新元素 */
nums[1] = 0; // 将索引 1 处的元素更新为 0 nums[1] = 0; // 将索引 1 处的元素更新为 0
``` ```
=== "C" === "C"

2
docs/chapter_hashing/hash_algorithm.md
View file

@ -223,7 +223,7 @@ $$
=== "Go" === "Go"
```go title="built_in_hash.go" ```go title="built_in_hash.go"
// Go 未提供内置 hash code 函数
``` ```
=== "Swift" === "Swift"