Bug fixes and improvements (#1572)

* Sync zh and zh-hant versions.

* Remove the polyfill.io link from mkdocs.yml

* Update contributors' info for code reviewers and en/zh-hant versions reviewers.

* Fix graph.md

* Update avatars for English version reviewers.

* Sync zh and zh-hant versions.

* Fix two_sum_brute_force.png

* Sync zh and zh-hant versions.
Optimize structrue of index.html.

* Format index.html

docs/index.html

@@ -353,4 +353,4 @@ <h3>贡献者</h3>
             </a>
         </div>
     </div>
-</section>
+</section>

en/docs/index.html

@@ -420,4 +420,4 @@ <h3>Contributors</h3>
             </a>
         </div>
     </div>
-</section>
+</section>

zh-hant/codes/c/chapter_searching/two_sum.c

@@ -37,12 +37,12 @@ HashTable *find(HashTable *h, int key) {
 }
 
 /* 雜湊表元素插入 */
-void insert(HashTable *h, int key, int val) {
-    HashTable *t = find(h, key);
+void insert(HashTable **h, int key, int val) {
+    HashTable *t = find(*h, key);
     if (t == NULL) {
         HashTable *tmp = malloc(sizeof(HashTable));
         tmp->key = key, tmp->val = val;
-        HASH_ADD_INT(h, key, tmp);
+        HASH_ADD_INT(*h, key, tmp);
     } else {
         t->val = val;
     }
@@ -59,7 +59,7 @@ int *twoSumHashTable(int *nums, int numsSize, int target, int *returnSize) {
             *returnSize = 2;
             return res;
         }
-        insert(hashtable, nums[i], i);
+        insert(&hashtable, nums[i], i);
     }
     *returnSize = 0;
     return NULL;
@@ -83,4 +83,4 @@ int main() {
     printArray(res, returnSize);
 
     return 0;
-}
+}

zh-hant/codes/c/chapter_sorting/counting_sort.c

@@ -65,6 +65,7 @@ void countingSort(int nums[], int size) {
     // 使用結果陣列 res 覆蓋原陣列 nums
     memcpy(nums, res, size * sizeof(int));
     // 5. 釋放記憶體
+    free(res);
     free(counter);
 }
 

zh-hant/codes/c/chapter_sorting/radix_sort.c

@@ -16,6 +16,7 @@ int digit(int num, int exp) {
 void countingSortDigit(int nums[], int size, int exp) {
     // 十進位制的位範圍為 0~9 ，因此需要長度為 10 的桶陣列
     int *counter = (int *)malloc((sizeof(int) * 10));
+    memset(counter, 0, sizeof(int) * 10); // 初始化為 0 以支持後續記憶體釋放
     // 統計 0~9 各數字的出現次數
     for (int i = 0; i < size; i++) {
         // 獲取 nums[i] 第 k 位，記為 d
@@ -39,13 +40,16 @@ void countingSortDigit(int nums[], int size, int exp) {
     for (int i = 0; i < size; i++) {
         nums[i] = res[i];
     }
+    // 釋放記憶體
+    free(res);
+    free(counter);
 }
 
 /* 基數排序 */
 void radixSort(int nums[], int size) {
     // 獲取陣列的最大元素，用於判斷最大位數
     int max = INT32_MIN;
-    for (size_t i = 0; i < size - 1; i++) {
+    for (int i = 0; i < size; i++) {
         if (nums[i] > max) {
             max = nums[i];
         }

zh-hant/codes/csharp/chapter_dynamic_programming/min_path_sum.cs

@@ -105,7 +105,7 @@ public void Test() {
 
         // 暴力搜尋
         int res = MinPathSumDFS(grid, n - 1, m - 1);
-        Console.WriteLine("從左上角到右下角的做小路徑和為 " + res);
+        Console.WriteLine("從左上角到右下角的最小路徑和為 " + res);
 
         // 記憶化搜尋
         int[][] mem = new int[n][];
@@ -114,14 +114,14 @@ public void Test() {
             Array.Fill(mem[i], -1);
         }
         res = MinPathSumDFSMem(grid, mem, n - 1, m - 1);
-        Console.WriteLine("從左上角到右下角的做小路徑和為 " + res);
+        Console.WriteLine("從左上角到右下角的最小路徑和為 " + res);
 
         // 動態規劃
         res = MinPathSumDP(grid);
-        Console.WriteLine("從左上角到右下角的做小路徑和為 " + res);
+        Console.WriteLine("從左上角到右下角的最小路徑和為 " + res);
 
         // 空間最佳化後的動態規劃
         res = MinPathSumDPComp(grid);
-        Console.WriteLine("從左上角到右下角的做小路徑和為 " + res);
+        Console.WriteLine("從左上角到右下角的最小路徑和為 " + res);
     }
 }

zh-hant/codes/csharp/chapter_heap/heap.cs

@@ -24,8 +24,8 @@ public void Test() {
         /* 初始化堆積 */
         // 初始化小頂堆積
         PriorityQueue<int, int> minHeap = new();
-        // 初始化大頂堆積（使用 lambda 表示式修改 Comparator 即可）
-        PriorityQueue<int, int> maxHeap = new(Comparer<int>.Create((x, y) => y - x));
+        // 初始化大頂堆積（使用 lambda 表示式修改 Comparer 即可）
+        PriorityQueue<int, int> maxHeap = new(Comparer<int>.Create((x, y) => y.CompareTo(x)));
         Console.WriteLine("以下測試樣例為大頂堆積");
 
         /* 元素入堆積 */

zh-hant/codes/dart/chapter_dynamic_programming/min_path_sum.dart

@@ -103,18 +103,18 @@ void main() {
 
 // 暴力搜尋
   int res = minPathSumDFS(grid, n - 1, m - 1);
-  print("從左上角到右下角的做小路徑和為 $res");
+  print("從左上角到右下角的最小路徑和為 $res");
 
 // 記憶化搜尋
   List<List<int>> mem = List.generate(n, (i) => List.filled(m, -1));
   res = minPathSumDFSMem(grid, mem, n - 1, m - 1);
-  print("從左上角到右下角的做小路徑和為 $res");
+  print("從左上角到右下角的最小路徑和為 $res");
 
 // 動態規劃
   res = minPathSumDP(grid);
-  print("從左上角到右下角的做小路徑和為 $res");
+  print("從左上角到右下角的最小路徑和為 $res");
 
 // 空間最佳化後的動態規劃
   res = minPathSumDPComp(grid);
-  print("從左上角到右下角的做小路徑和為 $res");
+  print("從左上角到右下角的最小路徑和為 $res");
 }

zh-hant/codes/go/chapter_dynamic_programming/min_path_sum_test.go

@@ -20,7 +20,7 @@ func TestMinPathSum(t *testing.T) {
 
 	// 暴力搜尋
 	res := minPathSumDFS(grid, n-1, m-1)
-	fmt.Printf("從左上角到右下角的做小路徑和為  %d\n", res)
+	fmt.Printf("從左上角到右下角的最小路徑和為  %d\n", res)
 
 	// 記憶化搜尋
 	mem := make([][]int, n)
@@ -31,13 +31,13 @@ func TestMinPathSum(t *testing.T) {
 		}
 	}
 	res = minPathSumDFSMem(grid, mem, n-1, m-1)
-	fmt.Printf("從左上角到右下角的做小路徑和為  %d\n", res)
+	fmt.Printf("從左上角到右下角的最小路徑和為  %d\n", res)
 
 	// 動態規劃
 	res = minPathSumDP(grid)
-	fmt.Printf("從左上角到右下角的做小路徑和為  %d\n", res)
+	fmt.Printf("從左上角到右下角的最小路徑和為  %d\n", res)
 
 	// 空間最佳化後的動態規劃
 	res = minPathSumDPComp(grid)
-	fmt.Printf("從左上角到右下角的做小路徑和為  %d\n", res)
+	fmt.Printf("從左上角到右下角的最小路徑和為  %d\n", res)
 }

zh-hant/codes/python/chapter_dynamic_programming/min_path_sum.py

@@ -88,17 +88,17 @@ def min_path_sum_dp_comp(grid: list[list[int]]) -> int:
 
     # 暴力搜尋
     res = min_path_sum_dfs(grid, n - 1, m - 1)
-    print(f"從左上角到右下角的做小路徑和為 {res}")
+    print(f"從左上角到右下角的最小路徑和為 {res}")
 
     # 記憶化搜尋
     mem = [[-1] * m for _ in range(n)]
     res = min_path_sum_dfs_mem(grid, mem, n - 1, m - 1)
-    print(f"從左上角到右下角的做小路徑和為 {res}")
+    print(f"從左上角到右下角的最小路徑和為 {res}")
 
     # 動態規劃
     res = min_path_sum_dp(grid)
-    print(f"從左上角到右下角的做小路徑和為 {res}")
+    print(f"從左上角到右下角的最小路徑和為 {res}")
 
     # 空間最佳化後的動態規劃
     res = min_path_sum_dp_comp(grid)
-    print(f"從左上角到右下角的做小路徑和為 {res}")
+    print(f"從左上角到右下角的最小路徑和為 {res}")

zh-hant/codes/ruby/chapter_dynamic_programming/min_path_sum.rb

@@ -76,18 +76,18 @@ def min_path_sum_dp_comp(grid)
 
   # 暴力搜尋
   res = min_path_sum_dfs(grid, n - 1, m - 1)
-  puts "從左上角到右下角的做小路徑和為 #{res}"
+  puts "從左上角到右下角的最小路徑和為 #{res}"
 
   # 記憶化搜尋
   mem = Array.new(n) { Array.new(m, - 1) }
   res = min_path_sum_dfs_mem(grid, mem, n - 1, m -1)
-  puts "從左上角到右下角的做小路徑和為 #{res}"
+  puts "從左上角到右下角的最小路徑和為 #{res}"
 
   # 動態規劃
   res = min_path_sum_dp(grid)
-  puts "從左上角到右下角的做小路徑和為 #{res}"
+  puts "從左上角到右下角的最小路徑和為 #{res}"
 
   # 空間最佳化後的動態規劃
   res = min_path_sum_dp_comp(grid)
-  puts "從左上角到右下角的做小路徑和為 #{res}"
+  puts "從左上角到右下角的最小路徑和為 #{res}"
 end

zh-hant/codes/rust/chapter_array_and_linkedlist/array.rs

@@ -4,8 +4,7 @@
  * Author: xBLACICEx ([email protected]), codingonion ([email protected])
  */
 
-include!("../include/include.rs");
-
+use hello_algo_rust::include::print_util;
 use rand::Rng;
 
 /* 隨機訪問元素 */

zh-hant/codes/rust/chapter_array_and_linkedlist/linked_list.rs

@@ -4,9 +4,7 @@
  * Author: codingonion ([email protected])
  */
 
-include!("../include/include.rs");
-
-use list_node::ListNode;
+use hello_algo_rust::include::{print_util, ListNode};
 use std::cell::RefCell;
 use std::rc::Rc;
 

zh-hant/codes/rust/chapter_array_and_linkedlist/list.rs

@@ -3,8 +3,7 @@
  * Created Time: 2023-01-18
  * Author: xBLACICEx ([email protected]), codingonion ([email protected])
  */
-
-include!("../include/include.rs");
+use hello_algo_rust::include::print_util;
 
 /* Driver Code */
 fn main() {

zh-hant/codes/rust/chapter_array_and_linkedlist/my_list.rs

@@ -4,7 +4,7 @@
  * Author: codingonion ([email protected])
  */
 
-include!("../include/include.rs");
+use hello_algo_rust::include::print_util;
 
 /* 串列類別 */
 #[allow(dead_code)]

zh-hant/codes/rust/chapter_backtracking/preorder_traversal_i_compact.rs

@@ -4,10 +4,8 @@
  * Author: codingonion ([email protected])
  */
 
-include!("../include/include.rs");
-
+use hello_algo_rust::include::{print_util, vec_to_tree, TreeNode};
 use std::{cell::RefCell, rc::Rc};
-use tree_node::{vec_to_tree, TreeNode};
 
 /* 前序走訪：例題一 */
 fn pre_order(res: &mut Vec<Rc<RefCell<TreeNode>>>, root: Option<&Rc<RefCell<TreeNode>>>) {

zh-hant/codes/rust/chapter_backtracking/preorder_traversal_ii_compact.rs

@@ -4,10 +4,8 @@
  * Author: codingonion ([email protected])
  */
 
-include!("../include/include.rs");
-
+use hello_algo_rust::include::{print_util, vec_to_tree, TreeNode};
 use std::{cell::RefCell, rc::Rc};
-use tree_node::{vec_to_tree, TreeNode};
 
 /* 前序走訪：例題二 */
 fn pre_order(

zh-hant/codes/rust/chapter_backtracking/preorder_traversal_iii_compact.rs

@@ -4,10 +4,8 @@
  * Author: codingonion ([email protected])
  */
 
-include!("../include/include.rs");
-
+use hello_algo_rust::include::{print_util, vec_to_tree, TreeNode};
 use std::{cell::RefCell, rc::Rc};
-use tree_node::{vec_to_tree, TreeNode};
 
 /* 前序走訪：例題三 */
 fn pre_order(

zh-hant/codes/rust/chapter_backtracking/preorder_traversal_iii_template.rs

@@ -4,10 +4,8 @@
  * Author: codingonion ([email protected])
  */
 
-include!("../include/include.rs");
-
+use hello_algo_rust::include::{print_util, vec_to_tree, TreeNode};
 use std::{cell::RefCell, rc::Rc};
-use tree_node::{vec_to_tree, TreeNode};
 
 /* 判斷當前狀態是否為解 */
 fn is_solution(state: &mut Vec<Rc<RefCell<TreeNode>>>) -> bool {

zh-hant/codes/rust/chapter_computational_complexity/space_complexity.rs

@@ -4,13 +4,10 @@
  * Author: codingonion ([email protected])
  */
 
-include!("../include/include.rs");
-
-use list_node::ListNode;
+use hello_algo_rust::include::{print_util, ListNode, TreeNode};
 use std::cell::RefCell;
 use std::collections::HashMap;
 use std::rc::Rc;
-use tree_node::TreeNode;
 
 /* 函式 */
 fn function() -> i32 {

zh-hant/codes/rust/chapter_computational_complexity/worst_best_time_complexity.rs

@@ -4,8 +4,7 @@
  * Author: xBLACICEx ([email protected]), codingonion ([email protected])
  */
 
-include!("../include/include.rs");
-
+use hello_algo_rust::include::print_util;
 use rand::seq::SliceRandom;
 use rand::thread_rng;
 

zh-hant/codes/rust/chapter_divide_and_conquer/build_tree.rs

@@ -4,10 +4,9 @@
  * Author: codingonion ([email protected])
  */
 
+use hello_algo_rust::include::{print_util, TreeNode};
 use std::collections::HashMap;
 use std::{cell::RefCell, rc::Rc};
-include!("../include/include.rs");
-use tree_node::TreeNode;
 
 /* 構建二元樹：分治 */
 fn dfs(

zh-hant/codes/rust/chapter_graph/graph_adjacency_list.rs

@@ -4,7 +4,7 @@
  * Author: night-cruise ([email protected])
  */
 
-include!("../include/vertex.rs");
+pub use hello_algo_rust::include::{vals_to_vets, vets_to_vals, Vertex};
 
 use std::collections::HashMap;
 

zh-hant/codes/rust/chapter_hashing/build_in_hash.rs

@@ -4,9 +4,8 @@
  * Author: WSL0809 ([email protected])
  */
 
-include!("../include/include.rs");
+use hello_algo_rust::include::ListNode;
 
-use crate::list_node::ListNode;
 use std::collections::hash_map::DefaultHasher;
 use std::hash::{Hash, Hasher};
 

zh-hant/codes/rust/chapter_hashing/hash_map.rs

@@ -4,7 +4,7 @@
  * Author: codingonion ([email protected])
  */
 
-include!("../include/include.rs");
+use hello_algo_rust::include::print_util;
 
 use std::collections::HashMap;
 

zh-hant/codes/rust/chapter_heap/heap.rs

@@ -4,7 +4,7 @@
  * Author: night-cruise ([email protected])
  */
 
-include!("../include/include.rs");
+use hello_algo_rust::include::print_util;
 
 use std::collections::BinaryHeap;
 

zh-hant/codes/rust/chapter_heap/my_heap.rs

@@ -4,7 +4,7 @@
  * Author: night-cruise ([email protected])
  */
 
-include!("../include/include.rs");
+use hello_algo_rust::include::print_util;
 
 /* 大頂堆積 */
 struct MaxHeap {

zh-hant/codes/rust/chapter_heap/top_k.rs

@@ -4,7 +4,7 @@
  * Author: night-cruise ([email protected])
  */
 
-include!("../include/include.rs");
+use hello_algo_rust::include::print_util;
 
 use std::cmp::Reverse;
 use std::collections::BinaryHeap;