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

fix(csharp): Modify method name to PascalCase, simplify new expression (#840)

Browse Source 
* Modify method name to PascalCase(array and linked list)

* Modify method name to PascalCase(backtracking)

* Modify method name to PascalCase(computational complexity)

* Modify method name to PascalCase(divide and conquer)

* Modify method name to PascalCase(dynamic programming)

* Modify method name to PascalCase(graph)

* Modify method name to PascalCase(greedy)

* Modify method name to PascalCase(hashing)

* Modify method name to PascalCase(heap)

* Modify method name to PascalCase(searching)

* Modify method name to PascalCase(sorting)

* Modify method name to PascalCase(stack and queue)

* Modify method name to PascalCase(tree)

* local check
This commit is contained in:
hpstory
2023-10-08 01:33:46 +08:00
committed by GitHub
parent 6f7e768cb7
commit f62256bee1
129 changed files with 1186 additions and 1192 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
docs/zh/chapter_array_and_linkedlist/array.md
View File

@@ -144,7 +144,7 @@
=== "C#"
```csharp title="array.cs"
[class]{array}-[func]{randomAccess}
[class]{array}-[func]{RandomAccess}
```
=== "Go"
@@ -224,7 +224,7 @@
=== "C#"
```csharp title="array.cs"
[class]{array}-[func]{insert}
[class]{array}-[func]{Insert}
```
=== "Go"
@@ -304,7 +304,7 @@
=== "C#"
```csharp title="array.cs"
[class]{array}-[func]{remove}
[class]{array}-[func]{Remove}
```
=== "Go"
@@ -386,7 +386,7 @@
=== "C#"
```csharp title="array.cs"
[class]{array}-[func]{traverse}
[class]{array}-[func]{Traverse}
```
=== "Go"
@@ -464,7 +464,7 @@
=== "C#"
```csharp title="array.cs"
[class]{array}-[func]{find}
[class]{array}-[func]{Find}
```
=== "Go"
@@ -542,7 +542,7 @@
=== "C#"
```csharp title="array.cs"
[class]{array}-[func]{extend}
[class]{array}-[func]{Extend}
```
=== "Go"

18
docs/zh/chapter_array_and_linkedlist/linked_list.md
View File

@@ -246,11 +246,11 @@
```csharp title="linked_list.cs"
/* 初始化链表 1 -> 3 -> 2 -> 5 -> 4 */
// 初始化各个节点
ListNode n0 = new ListNode(1);
ListNode n1 = new ListNode(3);
ListNode n2 = new ListNode(2);
ListNode n3 = new ListNode(5);
ListNode n4 = new ListNode(4);
ListNode n0 = new(1);
ListNode n1 = new(3);
ListNode n2 = new(2);
ListNode n3 = new(5);
ListNode n4 = new(4);
// 构建引用指向
n0.next = n1;
n1.next = n2;
@@ -426,7 +426,7 @@
=== "C#"
```csharp title="linked_list.cs"
[class]{linked_list}-[func]{insert}
[class]{linked_list}-[func]{Insert}
```
=== "Go"
@@ -506,7 +506,7 @@
=== "C#"
```csharp title="linked_list.cs"
[class]{linked_list}-[func]{remove}
[class]{linked_list}-[func]{Remove}
```
=== "Go"
@@ -582,7 +582,7 @@
=== "C#"
```csharp title="linked_list.cs"
[class]{linked_list}-[func]{access}
[class]{linked_list}-[func]{Access}
```
=== "Go"
@@ -658,7 +658,7 @@
=== "C#"
```csharp title="linked_list.cs"
[class]{linked_list}-[func]{find}
[class]{linked_list}-[func]{Find}
```
=== "Go"

2
docs/zh/chapter_array_and_linkedlist/list.md
View File

@@ -47,7 +47,7 @@
```csharp title="list.cs"
/* 初始化列表 */
// 无初始值
List<int> list1 = new ();
List<int> list1 = new();
// 有初始值
int[] numbers = new int[] { 1, 3, 2, 5, 4 };
List<int> list = numbers.ToList();

32
docs/zh/chapter_backtracking/backtracking_algorithm.md
View File

@@ -31,7 +31,7 @@
=== "C#"
```csharp title="preorder_traversal_i_compact.cs"
[class]{preorder_traversal_i_compact}-[func]{preOrder}
[class]{preorder_traversal_i_compact}-[func]{PreOrder}
```
=== "Go"
@@ -119,7 +119,7 @@
=== "C#"
```csharp title="preorder_traversal_ii_compact.cs"
[class]{preorder_traversal_ii_compact}-[func]{preOrder}
[class]{preorder_traversal_ii_compact}-[func]{PreOrder}
```
=== "Go"
@@ -238,7 +238,7 @@
=== "C#"
```csharp title="preorder_traversal_iii_compact.cs"
[class]{preorder_traversal_iii_compact}-[func]{preOrder}
[class]{preorder_traversal_iii_compact}-[func]{PreOrder}
```
=== "Go"
@@ -377,23 +377,23 @@
```csharp title=""
/* 回溯算法框架 */
void backtrack(State state, List<Choice> choices, List<State> res) {
void Backtrack(State state, List<Choice> choices, List<State> res) {
// 判断是否为解
if (isSolution(state)) {
if (IsSolution(state)) {
// 记录解
recordSolution(state, res);
RecordSolution(state, res);
// 停止继续搜索
return;
}
// 遍历所有选择
foreach (Choice choice in choices) {
// 剪枝：判断选择是否合法
if (isValid(state, choice)) {
if (IsValid(state, choice)) {
// 尝试：做出选择，更新状态
makeChoice(state, choice);
backtrack(state, choices, res);
MakeChoice(state, choice);
Backtrack(state, choices, res);
// 回退：撤销选择，恢复到之前的状态
undoChoice(state, choice);
UndoChoice(state, choice);
}
}
}
@@ -640,17 +640,17 @@
=== "C#"
```csharp title="preorder_traversal_iii_template.cs"
[class]{preorder_traversal_iii_template}-[func]{isSolution}
[class]{preorder_traversal_iii_template}-[func]{IsSolution}
[class]{preorder_traversal_iii_template}-[func]{recordSolution}
[class]{preorder_traversal_iii_template}-[func]{RecordSolution}
[class]{preorder_traversal_iii_template}-[func]{isValid}
[class]{preorder_traversal_iii_template}-[func]{IsValid}
[class]{preorder_traversal_iii_template}-[func]{makeChoice}
[class]{preorder_traversal_iii_template}-[func]{MakeChoice}
[class]{preorder_traversal_iii_template}-[func]{undoChoice}
[class]{preorder_traversal_iii_template}-[func]{UndoChoice}
[class]{preorder_traversal_iii_template}-[func]{backtrack}
[class]{preorder_traversal_iii_template}-[func]{Backtrack}
```
=== "Go"

4
docs/zh/chapter_backtracking/n_queens_problem.md
View File

@@ -67,9 +67,9 @@
=== "C#"
```csharp title="n_queens.cs"
[class]{n_queens}-[func]{backtrack}
[class]{n_queens}-[func]{Backtrack}
[class]{n_queens}-[func]{nQueens}
[class]{n_queens}-[func]{NQueens}
```
=== "Go"

8
docs/zh/chapter_backtracking/permutations_problem.md
View File

@@ -70,9 +70,9 @@
=== "C#"
```csharp title="permutations_i.cs"
[class]{permutations_i}-[func]{backtrack}
[class]{permutations_i}-[func]{Backtrack}
[class]{permutations_i}-[func]{permutationsI}
[class]{permutations_i}-[func]{PermutationsI}
```
=== "Go"
@@ -194,9 +194,9 @@
=== "C#"
```csharp title="permutations_ii.cs"
[class]{permutations_ii}-[func]{backtrack}
[class]{permutations_ii}-[func]{Backtrack}
[class]{permutations_ii}-[func]{permutationsII}
[class]{permutations_ii}-[func]{PermutationsII}
```
=== "Go"

12
docs/zh/chapter_backtracking/subset_sum_problem.md
View File

@@ -44,9 +44,9 @@
=== "C#"
```csharp title="subset_sum_i_naive.cs"
[class]{subset_sum_i_naive}-[func]{backtrack}
[class]{subset_sum_i_naive}-[func]{Backtrack}
[class]{subset_sum_i_naive}-[func]{subsetSumINaive}
[class]{subset_sum_i_naive}-[func]{SubsetSumINaive}
```
=== "Go"
@@ -177,9 +177,9 @@
=== "C#"
```csharp title="subset_sum_i.cs"
[class]{subset_sum_i}-[func]{backtrack}
[class]{subset_sum_i}-[func]{Backtrack}
[class]{subset_sum_i}-[func]{subsetSumI}
[class]{subset_sum_i}-[func]{SubsetSumI}
```
=== "Go"
@@ -297,9 +297,9 @@
=== "C#"
```csharp title="subset_sum_ii.cs"
[class]{subset_sum_ii}-[func]{backtrack}
[class]{subset_sum_ii}-[func]{Backtrack}
[class]{subset_sum_ii}-[func]{subsetSumII}
[class]{subset_sum_ii}-[func]{SubsetSumII}
```
=== "Go"

16
docs/zh/chapter_computational_complexity/iteration_and_recursion.md
View File

@@ -33,7 +33,7 @@
=== "C#"
```csharp title="iteration.cs"
[class]{iteration}-[func]{forLoop}
[class]{iteration}-[func]{ForLoop}
```
=== "Go"
@@ -117,7 +117,7 @@
=== "C#"
```csharp title="iteration.cs"
[class]{iteration}-[func]{whileLoop}
[class]{iteration}-[func]{WhileLoop}
```
=== "Go"
@@ -193,7 +193,7 @@
=== "C#"
```csharp title="iteration.cs"
[class]{iteration}-[func]{whileLoopII}
[class]{iteration}-[func]{WhileLoopII}
```
=== "Go"
@@ -271,7 +271,7 @@
=== "C#"
```csharp title="iteration.cs"
[class]{iteration}-[func]{nestedForLoop}
[class]{iteration}-[func]{NestedForLoop}
```
=== "Go"
@@ -366,7 +366,7 @@
=== "C#"
```csharp title="recursion.cs"
[class]{recursion}-[func]{recur}
[class]{recursion}-[func]{Recur}
```
=== "Go"
@@ -474,7 +474,7 @@
=== "C#"
```csharp title="recursion.cs"
[class]{recursion}-[func]{tailRecur}
[class]{recursion}-[func]{TailRecur}
```
=== "Go"
@@ -572,7 +572,7 @@
=== "C#"
```csharp title="recursion.cs"
[class]{recursion}-[func]{fib}
[class]{recursion}-[func]{Fib}
```
=== "Go"
@@ -679,7 +679,7 @@
=== "C#"
```csharp title="recursion.cs"
[class]{recursion}-[func]{forLoopRecur}
[class]{recursion}-[func]{ForLoopRecur}
```
=== "Go"

34
docs/zh/chapter_computational_complexity/space_complexity.md
View File

@@ -105,16 +105,16 @@
}
/* 函数 */
int function() {
int Function() {
// 执行某些操作...
return 0;
}
int algorithm(int n) { // 输入数据
int Algorithm(int n) { // 输入数据
const int a = 0; // 暂存数据（常量）
int b = 0; // 暂存数据（变量）
Node node = new Node(0); // 暂存数据（对象）
int c = function(); // 栈帧空间（调用函数）
Node node = new(0); // 暂存数据（对象）
int c = Function(); // 栈帧空间（调用函数）
return a + b + c; // 输出数据
}
```
@@ -360,7 +360,7 @@
=== "C#"
```csharp title=""
void algorithm(int n) {
void Algorithm(int n) {
int a = 0; // O(1)
int[] b = new int[10000]; // O(1)
if (n > 10) {
@@ -526,20 +526,20 @@
=== "C#"
```csharp title=""
int function() {
int Function() {
// 执行某些操作
return 0;
}
/* 循环 O(1) */
void loop(int n) {
void Loop(int n) {
for (int i = 0; i < n; i++) {
function();
Function();
}
}
/* 递归 O(n) */
int recur(int n) {
int Recur(int n) {
if (n == 1) return 1;
return recur(n - 1);
return Recur(n - 1);
}
```
@@ -746,9 +746,9 @@ $$
=== "C#"
```csharp title="space_complexity.cs"
[class]{space_complexity}-[func]{function}
[class]{space_complexity}-[func]{Function}
[class]{space_complexity}-[func]{constant}
[class]{space_complexity}-[func]{Constant}
```
=== "Go"
@@ -840,7 +840,7 @@ $$
=== "C#"
```csharp title="space_complexity.cs"
[class]{space_complexity}-[func]{linear}
[class]{space_complexity}-[func]{Linear}
```
=== "Go"
@@ -916,7 +916,7 @@ $$
=== "C#"
```csharp title="space_complexity.cs"
[class]{space_complexity}-[func]{linearRecur}
[class]{space_complexity}-[func]{LinearRecur}
```
=== "Go"
@@ -994,7 +994,7 @@ $$
=== "C#"
```csharp title="space_complexity.cs"
[class]{space_complexity}-[func]{quadratic}
[class]{space_complexity}-[func]{Quadratic}
```
=== "Go"
@@ -1068,7 +1068,7 @@ $$
=== "C#"
```csharp title="space_complexity.cs"
[class]{space_complexity}-[func]{quadraticRecur}
[class]{space_complexity}-[func]{QuadraticRecur}
```
=== "Go"
@@ -1146,7 +1146,7 @@ $$
=== "C#"
```csharp title="space_complexity.cs"
[class]{space_complexity}-[func]{buildTree}
[class]{space_complexity}-[func]{BuildTree}
```
=== "Go"

38
docs/zh/chapter_computational_complexity/time_complexity.md
View File

@@ -55,7 +55,7 @@
```csharp title=""
// 在某运行平台下
void algorithm(int n) {
void Algorithm(int n) {
int a = 2; // 1 ns
a = a + 1; // 1 ns
a = a * 2; // 10 ns
@@ -253,17 +253,17 @@ $$
```csharp title=""
// 算法 A 的时间复杂度：常数阶
void algorithm_A(int n) {
void AlgorithmA(int n) {
Console.WriteLine(0);
}
// 算法 B 的时间复杂度：线性阶
void algorithm_B(int n) {
void AlgorithmB(int n) {
for (int i = 0; i < n; i++) {
Console.WriteLine(0);
}
}
// 算法 C 的时间复杂度：常数阶
void algorithm_C(int n) {
void AlgorithmC(int n) {
for (int i = 0; i < 1000000; i++) {
Console.WriteLine(0);
}
@@ -487,7 +487,7 @@ $$
=== "C#"
```csharp title=""
void algorithm(int n) {
void Algorithm(int n) {
int a = 1; // +1
a = a + 1; // +1
a = a * 2; // +1
@@ -695,7 +695,7 @@ $T(n)$ 是一次函数，说明其运行时间的增长趋势是线性的，因
=== "C#"
```csharp title=""
void algorithm(int n) {
void Algorithm(int n) {
int a = 1; // +0（技巧 1）
a = a + n; // +0（技巧 1）
// +n（技巧 2）
@@ -918,7 +918,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
[class]{time_complexity}-[func]{constant}
[class]{time_complexity}-[func]{Constant}
```
=== "Go"
@@ -994,7 +994,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
[class]{time_complexity}-[func]{linear}
[class]{time_complexity}-[func]{Linear}
```
=== "Go"
@@ -1068,7 +1068,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
[class]{time_complexity}-[func]{arrayTraversal}
[class]{time_complexity}-[func]{ArrayTraversal}
```
=== "Go"
@@ -1146,7 +1146,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
[class]{time_complexity}-[func]{quadratic}
[class]{time_complexity}-[func]{Quadratic}
```
=== "Go"
@@ -1224,7 +1224,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
[class]{time_complexity}-[func]{bubbleSort}
[class]{time_complexity}-[func]{BubbleSort}
```
=== "Go"
@@ -1302,7 +1302,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
[class]{time_complexity}-[func]{exponential}
[class]{time_complexity}-[func]{Exponential}
```
=== "Go"
@@ -1378,7 +1378,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
[class]{time_complexity}-[func]{expRecur}
[class]{time_complexity}-[func]{ExpRecur}
```
=== "Go"
@@ -1458,7 +1458,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
[class]{time_complexity}-[func]{logarithmic}
[class]{time_complexity}-[func]{Logarithmic}
```
=== "Go"
@@ -1534,7 +1534,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
[class]{time_complexity}-[func]{logRecur}
[class]{time_complexity}-[func]{LogRecur}
```
=== "Go"
@@ -1622,7 +1622,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
[class]{time_complexity}-[func]{linearLogRecur}
[class]{time_complexity}-[func]{LinearLogRecur}
```
=== "Go"
@@ -1710,7 +1710,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
[class]{time_complexity}-[func]{factorialRecur}
[class]{time_complexity}-[func]{FactorialRecur}
```
=== "Go"
@@ -1801,9 +1801,9 @@ $$
=== "C#"
```csharp title="worst_best_time_complexity.cs"
[class]{worst_best_time_complexity}-[func]{randomNumbers}
[class]{worst_best_time_complexity}-[func]{RandomNumbers}
[class]{worst_best_time_complexity}-[func]{findOne}
[class]{worst_best_time_complexity}-[func]{FindOne}
```
=== "Go"

4
docs/zh/chapter_divide_and_conquer/binary_search_recur.md
View File

@@ -67,9 +67,9 @@
=== "C#"
```csharp title="binary_search_recur.cs"
[class]{binary_search_recur}-[func]{dfs}
[class]{binary_search_recur}-[func]{Dfs}
[class]{binary_search_recur}-[func]{binarySearch}
[class]{binary_search_recur}-[func]{BinarySearch}
```
=== "Go"

4
docs/zh/chapter_divide_and_conquer/build_binary_tree_problem.md
View File

@@ -84,9 +84,9 @@
=== "C#"
```csharp title="build_tree.cs"
[class]{build_tree}-[func]{dfs}
[class]{build_tree}-[func]{Dfs}
[class]{build_tree}-[func]{buildTree}
[class]{build_tree}-[func]{BuildTree}
```
=== "Go"

6
docs/zh/chapter_divide_and_conquer/hanota_problem.md
View File

@@ -115,11 +115,11 @@
=== "C#"
```csharp title="hanota.cs"
[class]{hanota}-[func]{move}
[class]{hanota}-[func]{Move}
[class]{hanota}-[func]{dfs}
[class]{hanota}-[func]{Dfs}
[class]{hanota}-[func]{solveHanota}
[class]{hanota}-[func]{SolveHanota}
```
=== "Go"

6
docs/zh/chapter_dynamic_programming/dp_problem_features.md
View File

@@ -55,7 +55,7 @@ $$
=== "C#"
```csharp title="min_cost_climbing_stairs_dp.cs"
[class]{min_cost_climbing_stairs_dp}-[func]{minCostClimbingStairsDP}
[class]{min_cost_climbing_stairs_dp}-[func]{MinCostClimbingStairsDP}
```
=== "Go"
@@ -133,7 +133,7 @@ $$
=== "C#"
```csharp title="min_cost_climbing_stairs_dp.cs"
[class]{min_cost_climbing_stairs_dp}-[func]{minCostClimbingStairsDPComp}
[class]{min_cost_climbing_stairs_dp}-[func]{MinCostClimbingStairsDPComp}
```
=== "Go"
@@ -243,7 +243,7 @@ $$
=== "C#"
```csharp title="climbing_stairs_constraint_dp.cs"
[class]{climbing_stairs_constraint_dp}-[func]{climbingStairsConstraintDP}
[class]{climbing_stairs_constraint_dp}-[func]{ClimbingStairsConstraintDP}
```
=== "Go"

8
docs/zh/chapter_dynamic_programming/dp_solution_pipeline.md
View File

@@ -119,7 +119,7 @@ $$
=== "C#"
```csharp title="min_path_sum.cs"
[class]{min_path_sum}-[func]{minPathSumDFS}
[class]{min_path_sum}-[func]{MinPathSumDFS}
```
=== "Go"
@@ -203,7 +203,7 @@ $$
=== "C#"
```csharp title="min_path_sum.cs"
[class]{min_path_sum}-[func]{minPathSumDFSMem}
[class]{min_path_sum}-[func]{MinPathSumDFSMem}
```
=== "Go"
@@ -283,7 +283,7 @@ $$
=== "C#"
```csharp title="min_path_sum.cs"
[class]{min_path_sum}-[func]{minPathSumDP}
[class]{min_path_sum}-[func]{MinPathSumDP}
```
=== "Go"
@@ -401,7 +401,7 @@ $$
=== "C#"
```csharp title="min_path_sum.cs"
[class]{min_path_sum}-[func]{minPathSumDPComp}
[class]{min_path_sum}-[func]{MinPathSumDPComp}
```
=== "Go"

4
docs/zh/chapter_dynamic_programming/edit_distance_problem.md
View File

@@ -88,7 +88,7 @@ $$
=== "C#"
```csharp title="edit_distance.cs"
[class]{edit_distance}-[func]{editDistanceDP}
[class]{edit_distance}-[func]{EditDistanceDP}
```
=== "Go"
@@ -213,7 +213,7 @@ $$
=== "C#"
```csharp title="edit_distance.cs"
[class]{edit_distance}-[func]{editDistanceDPComp}
[class]{edit_distance}-[func]{EditDistanceDPComp}
```
=== "Go"

16
docs/zh/chapter_dynamic_programming/intro_to_dynamic_programming.md
View File

@@ -41,9 +41,9 @@
=== "C#"
```csharp title="climbing_stairs_backtrack.cs"
[class]{climbing_stairs_backtrack}-[func]{backtrack}
[class]{climbing_stairs_backtrack}-[func]{Backtrack}
[class]{climbing_stairs_backtrack}-[func]{climbingStairsBacktrack}
[class]{climbing_stairs_backtrack}-[func]{ClimbingStairsBacktrack}
```
=== "Go"
@@ -163,9 +163,9 @@ $$
=== "C#"
```csharp title="climbing_stairs_dfs.cs"
[class]{climbing_stairs_dfs}-[func]{dfs}
[class]{climbing_stairs_dfs}-[func]{Dfs}
[class]{climbing_stairs_dfs}-[func]{climbingStairsDFS}
[class]{climbing_stairs_dfs}-[func]{ClimbingStairsDFS}
```
=== "Go"
@@ -274,9 +274,9 @@ $$
=== "C#"
```csharp title="climbing_stairs_dfs_mem.cs"
[class]{climbing_stairs_dfs_mem}-[func]{dfs}
[class]{climbing_stairs_dfs_mem}-[func]{Dfs}
[class]{climbing_stairs_dfs_mem}-[func]{climbingStairsDFSMem}
[class]{climbing_stairs_dfs_mem}-[func]{ClimbingStairsDFSMem}
```
=== "Go"
@@ -376,7 +376,7 @@ $$
=== "C#"
```csharp title="climbing_stairs_dp.cs"
[class]{climbing_stairs_dp}-[func]{climbingStairsDP}
[class]{climbing_stairs_dp}-[func]{ClimbingStairsDP}
```
=== "Go"
@@ -464,7 +464,7 @@ $$
=== "C#"
```csharp title="climbing_stairs_dp.cs"
[class]{climbing_stairs_dp}-[func]{climbingStairsDPComp}
[class]{climbing_stairs_dp}-[func]{ClimbingStairsDPComp}
```
=== "Go"

8
docs/zh/chapter_dynamic_programming/knapsack_problem.md
View File

@@ -77,7 +77,7 @@ $$
=== "C#"
```csharp title="knapsack.cs"
[class]{knapsack}-[func]{knapsackDFS}
[class]{knapsack}-[func]{KnapsackDFS}
```
=== "Go"
@@ -161,7 +161,7 @@ $$
=== "C#"
```csharp title="knapsack.cs"
[class]{knapsack}-[func]{knapsackDFSMem}
[class]{knapsack}-[func]{KnapsackDFSMem}
```
=== "Go"
@@ -241,7 +241,7 @@ $$
=== "C#"
```csharp title="knapsack.cs"
[class]{knapsack}-[func]{knapsackDP}
[class]{knapsack}-[func]{KnapsackDP}
```
=== "Go"
@@ -388,7 +388,7 @@ $$
=== "C#"
```csharp title="knapsack.cs"
[class]{knapsack}-[func]{knapsackDPComp}
[class]{knapsack}-[func]{KnapsackDPComp}
```
=== "Go"

12
docs/zh/chapter_dynamic_programming/unbounded_knapsack_problem.md
View File

@@ -53,7 +53,7 @@ $$
=== "C#"
```csharp title="unbounded_knapsack.cs"
[class]{unbounded_knapsack}-[func]{unboundedKnapsackDP}
[class]{unbounded_knapsack}-[func]{UnboundedKnapsackDP}
```
=== "Go"
@@ -151,7 +151,7 @@ $$
=== "C#"
```csharp title="unbounded_knapsack.cs"
[class]{unbounded_knapsack}-[func]{unboundedKnapsackDPComp}
[class]{unbounded_knapsack}-[func]{UnboundedKnapsackDPComp}
```
=== "Go"
@@ -272,7 +272,7 @@ $$
=== "C#"
```csharp title="coin_change.cs"
[class]{coin_change}-[func]{coinChangeDP}
[class]{coin_change}-[func]{CoinChangeDP}
```
=== "Go"
@@ -395,7 +395,7 @@ $$
=== "C#"
```csharp title="coin_change.cs"
[class]{coin_change}-[func]{coinChangeDPComp}
[class]{coin_change}-[func]{CoinChangeDPComp}
```
=== "Go"
@@ -489,7 +489,7 @@ $$
=== "C#"
```csharp title="coin_change_ii.cs"
[class]{coin_change_ii}-[func]{coinChangeIIDP}
[class]{coin_change_ii}-[func]{CoinChangeIIDP}
```
=== "Go"
@@ -565,7 +565,7 @@ $$
=== "C#"
```csharp title="coin_change_ii.cs"
[class]{coin_change_ii}-[func]{coinChangeIIDPComp}
[class]{coin_change_ii}-[func]{CoinChangeIIDPComp}
```
=== "Go"

6
docs/zh/chapter_graph/graph_traversal.md
View File

@@ -41,7 +41,7 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
=== "C#"
```csharp title="graph_bfs.cs"
[class]{graph_bfs}-[func]{graphBFS}
[class]{graph_bfs}-[func]{GraphBFS}
```
=== "Go"
@@ -174,9 +174,9 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
=== "C#"
```csharp title="graph_dfs.cs"
[class]{graph_dfs}-[func]{dfs}
[class]{graph_dfs}-[func]{Dfs}
[class]{graph_dfs}-[func]{graphDFS}
[class]{graph_dfs}-[func]{GraphDFS}
```
=== "Go"

2
docs/zh/chapter_greedy/fractional_knapsack_problem.md
View File

@@ -58,7 +58,7 @@
```csharp title="fractional_knapsack.cs"
[class]{Item}-[func]{}
[class]{fractional_knapsack}-[func]{fractionalKnapsack}
[class]{fractional_knapsack}-[func]{FractionalKnapsack}
```
=== "Go"

2
docs/zh/chapter_greedy/greedy_algorithm.md
View File

@@ -40,7 +40,7 @@
=== "C#"
```csharp title="coin_change_greedy.cs"
[class]{coin_change_greedy}-[func]{coinChangeGreedy}
[class]{coin_change_greedy}-[func]{CoinChangeGreedy}
```
=== "Go"

2
docs/zh/chapter_greedy/max_capacity_problem.md
View File

@@ -99,7 +99,7 @@ $$
=== "C#"
```csharp title="max_capacity.cs"
[class]{max_capacity}-[func]{maxCapacity}
[class]{max_capacity}-[func]{MaxCapacity}
```
=== "Go"

2
docs/zh/chapter_greedy/max_product_cutting_problem.md
View File

@@ -84,7 +84,7 @@ $$
=== "C#"
```csharp title="max_product_cutting.cs"
[class]{max_product_cutting}-[func]{maxProductCutting}
[class]{max_product_cutting}-[func]{MaxProductCutting}
```
=== "Go"

10
docs/zh/chapter_hashing/hash_algorithm.md
View File

@@ -85,13 +85,13 @@ index = hash(key) % capacity
=== "C#"
```csharp title="simple_hash.cs"
[class]{simple_hash}-[func]{addHash}
[class]{simple_hash}-[func]{AddHash}
[class]{simple_hash}-[func]{mulHash}
[class]{simple_hash}-[func]{MulHash}
[class]{simple_hash}-[func]{xorHash}
[class]{simple_hash}-[func]{XorHash}
[class]{simple_hash}-[func]{rotHash}
[class]{simple_hash}-[func]{RotHash}
```
=== "Go"
@@ -355,7 +355,7 @@ $$
int hashTup = arr.GetHashCode();
// 数组 [12836, 小哈] 的哈希值为 42931033;
ListNode obj = new ListNode(0);
ListNode obj = new(0);
int hashObj = obj.GetHashCode();
// 节点对象 0 的哈希值为 39053774;
```

20
docs/zh/chapter_hashing/hash_map.md
View File

@@ -99,19 +99,19 @@
```csharp title="hash_map.cs"
/* 初始化哈希表 */
Dictionary<int, String> map = new ();
/* 添加操作 */
// 在哈希表中添加键值对 (key, value)
map.Add(12836, "小哈");
map.Add(15937, "小啰");
map.Add(16750, "小算");
map.Add(13276, "小法");
map.Add(10583, "小鸭");
Dictionary<int, string> map = new() {
/* 添加操作 */
// 在哈希表中添加键值对 (key, value)
{ 12836, "小哈" },
{ 15937, "小啰" },
{ 16750, "小算" },
{ 13276, "小法" },
{ 10583, "小鸭" }
};
/* 查询操作 */
// 向哈希表输入键 key ，得到值 value
String name = map[15937];
string name = map[15937];
/* 删除操作 */
// 在哈希表中删除键值对 (key, value)

20
docs/zh/chapter_heap/heap.md
View File

@@ -158,9 +158,9 @@
```csharp title="heap.cs"
/* 初始化堆 */
// 初始化小顶堆
PriorityQueue<int, int> minHeap = new PriorityQueue<int, int>();
PriorityQueue<int, int> minHeap = new();
// 初始化大顶堆（使用 lambda 表达式修改 Comparator 即可）
PriorityQueue<int, int> maxHeap = new PriorityQueue<int, int>(Comparer<int>.Create((x, y) => y - x));
PriorityQueue<int, int> maxHeap = new(Comparer<int>.Create((x, y) => y - x));
/* 元素入堆 */
maxHeap.Enqueue(1, 1);
@@ -394,11 +394,11 @@
=== "C#"
```csharp title="my_heap.cs"
[class]{MaxHeap}-[func]{left}
[class]{MaxHeap}-[func]{Left}
[class]{MaxHeap}-[func]{right}
[class]{MaxHeap}-[func]{Right}
[class]{MaxHeap}-[func]{parent}
[class]{MaxHeap}-[func]{Parent}
```
=== "Go"
@@ -506,7 +506,7 @@
=== "C#"
```csharp title="my_heap.cs"
[class]{MaxHeap}-[func]{peek}
[class]{MaxHeap}-[func]{Peek}
```
=== "Go"
@@ -619,9 +619,9 @@
=== "C#"
```csharp title="my_heap.cs"
[class]{MaxHeap}-[func]{push}
[class]{MaxHeap}-[func]{Push}
[class]{MaxHeap}-[func]{siftUp}
[class]{MaxHeap}-[func]{SiftUp}
```
=== "Go"
@@ -757,9 +757,9 @@
=== "C#"
```csharp title="my_heap.cs"
[class]{MaxHeap}-[func]{pop}
[class]{MaxHeap}-[func]{Pop}
[class]{MaxHeap}-[func]{siftDown}
[class]{MaxHeap}-[func]{SiftDown}
```
=== "Go"

2
docs/zh/chapter_heap/top_k.md
View File

@@ -87,7 +87,7 @@
=== "C#"
```csharp title="top_k.cs"
[class]{top_k}-[func]{topKHeap}
[class]{top_k}-[func]{TopKHeap}
```
=== "Go"

4
docs/zh/chapter_searching/binary_search.md
View File

@@ -64,7 +64,7 @@
=== "C#"
```csharp title="binary_search.cs"
[class]{binary_search}-[func]{binarySearch}
[class]{binary_search}-[func]{BinarySearch}
```
=== "Go"
@@ -146,7 +146,7 @@
=== "C#"
```csharp title="binary_search.cs"
[class]{binary_search}-[func]{binarySearchLCRO}
[class]{binary_search}-[func]{BinarySearchLCRO}
```
=== "Go"

4
docs/zh/chapter_searching/binary_search_edge.md
View File

@@ -36,7 +36,7 @@
=== "C#"
```csharp title="binary_search_edge.cs"
[class]{binary_search_edge}-[func]{binarySearchLeftEdge}
[class]{binary_search_edge}-[func]{BinarySearchLeftEdge}
```
=== "Go"
@@ -124,7 +124,7 @@
=== "C#"
```csharp title="binary_search_edge.cs"
[class]{binary_search_edge}-[func]{binarySearchRightEdge}
[class]{binary_search_edge}-[func]{BinarySearchRightEdge}
```
=== "Go"

4
docs/zh/chapter_searching/binary_search_insertion.md
View File

@@ -43,7 +43,7 @@
=== "C#"
```csharp title="binary_search_insertion.cs"
[class]{binary_search_insertion}-[func]{binarySearchInsertionSimple}
[class]{binary_search_insertion}-[func]{BinarySearchInsertionSimple}
```
=== "Go"
@@ -167,7 +167,7 @@
=== "C#"
```csharp title="binary_search_insertion.cs"
[class]{binary_search_insertion}-[func]{binarySearchInsertion}
[class]{binary_search_insertion}-[func]{BinarySearchInsertion}
```
=== "Go"

4
docs/zh/chapter_searching/replace_linear_by_hashing.md
View File

@@ -33,7 +33,7 @@
=== "C#"
```csharp title="two_sum.cs"
[class]{two_sum}-[func]{twoSumBruteForce}
[class]{two_sum}-[func]{TwoSumBruteForce}
```
=== "Go"
@@ -125,7 +125,7 @@
=== "C#"
```csharp title="two_sum.cs"
[class]{two_sum}-[func]{twoSumHashTable}
[class]{two_sum}-[func]{TwoSumHashTable}
```
=== "Go"

4
docs/zh/chapter_sorting/bubble_sort.md
View File

@@ -57,7 +57,7 @@
=== "C#"
```csharp title="bubble_sort.cs"
[class]{bubble_sort}-[func]{bubbleSort}
[class]{bubble_sort}-[func]{BubbleSort}
```
=== "Go"
@@ -135,7 +135,7 @@
=== "C#"
```csharp title="bubble_sort.cs"
[class]{bubble_sort}-[func]{bubbleSortWithFlag}
[class]{bubble_sort}-[func]{BubbleSortWithFlag}
```
=== "Go"

2
docs/zh/chapter_sorting/bucket_sort.md
View File

@@ -35,7 +35,7 @@
=== "C#"
```csharp title="bucket_sort.cs"
[class]{bucket_sort}-[func]{bucketSort}
[class]{bucket_sort}-[func]{BucketSort}
```
=== "Go"

4
docs/zh/chapter_sorting/counting_sort.md
View File

@@ -33,7 +33,7 @@
=== "C#"
```csharp title="counting_sort.cs"
[class]{counting_sort}-[func]{countingSortNaive}
[class]{counting_sort}-[func]{CountingSortNaive}
```
=== "Go"
@@ -152,7 +152,7 @@ $$
=== "C#"
```csharp title="counting_sort.cs"
[class]{counting_sort}-[func]{countingSort}
[class]{counting_sort}-[func]{CountingSort}
```
=== "Go"

4
docs/zh/chapter_sorting/heap_sort.md
View File

@@ -89,9 +89,9 @@
=== "C#"
```csharp title="heap_sort.cs"
[class]{heap_sort}-[func]{siftDown}
[class]{heap_sort}-[func]{SiftDown}
[class]{heap_sort}-[func]{heapSort}
[class]{heap_sort}-[func]{HeapSort}
```
=== "Go"

2
docs/zh/chapter_sorting/insertion_sort.md
View File

@@ -40,7 +40,7 @@
=== "C#"
```csharp title="insertion_sort.cs"
[class]{insertion_sort}-[func]{insertionSort}
[class]{insertion_sort}-[func]{InsertionSort}
```
=== "Go"

4
docs/zh/chapter_sorting/merge_sort.md
View File

@@ -78,9 +78,9 @@
=== "C#"
```csharp title="merge_sort.cs"
[class]{merge_sort}-[func]{merge}
[class]{merge_sort}-[func]{Merge}
[class]{merge_sort}-[func]{mergeSort}
[class]{merge_sort}-[func]{MergeSort}
```
=== "Go"

12
docs/zh/chapter_sorting/quick_sort.md
View File

@@ -66,9 +66,9 @@
=== "C#"
```csharp title="quick_sort.cs"
[class]{QuickSort}-[func]{swap}
[class]{quickSort}-[func]{Swap}
[class]{QuickSort}-[func]{partition}
[class]{quickSort}-[func]{Partition}
```
=== "Go"
@@ -162,7 +162,7 @@
=== "C#"
```csharp title="quick_sort.cs"
[class]{QuickSort}-[func]{quickSort}
[class]{quickSort}-[func]{QuickSort}
```
=== "Go"
@@ -264,9 +264,9 @@
=== "C#"
```csharp title="quick_sort.cs"
[class]{QuickSortMedian}-[func]{medianThree}
[class]{QuickSortMedian}-[func]{MedianThree}
[class]{QuickSortMedian}-[func]{partition}
[class]{QuickSortMedian}-[func]{Partition}
```
=== "Go"
@@ -360,7 +360,7 @@
=== "C#"
```csharp title="quick_sort.cs"
[class]{QuickSortTailCall}-[func]{quickSort}
[class]{QuickSortTailCall}-[func]{QuickSort}
```
=== "Go"

6
docs/zh/chapter_sorting/radix_sort.md
View File

@@ -57,11 +57,11 @@ $$
=== "C#"
```csharp title="radix_sort.cs"
[class]{radix_sort}-[func]{digit}
[class]{radix_sort}-[func]{Digit}
[class]{radix_sort}-[func]{countingSortDigit}
[class]{radix_sort}-[func]{CountingSortDigit}
[class]{radix_sort}-[func]{radixSort}
[class]{radix_sort}-[func]{RadixSort}
```
=== "Go"

2
docs/zh/chapter_sorting/selection_sort.md
View File

@@ -66,7 +66,7 @@
=== "C#"
```csharp title="selection_sort.cs"
[class]{selection_sort}-[func]{selectionSort}
[class]{selection_sort}-[func]{SelectionSort}
```
=== "Go"

2
docs/zh/chapter_stack_and_queue/deque.md
View File

@@ -110,7 +110,7 @@
```csharp title="deque.cs"
/* 初始化双向队列 */
// 在 C# 中，将链表 LinkedList 看作双向队列来使用
LinkedList<int> deque = new LinkedList<int>();
LinkedList<int> deque = new();
/* 元素入队 */
deque.AddLast(2); // 添加至队尾

2
docs/zh/chapter_stack_and_queue/stack.md
View File

@@ -105,7 +105,7 @@
```csharp title="stack.cs"
/* 初始化栈 */
Stack<int> stack = new ();
Stack<int> stack = new();
/* 元素入栈 */
stack.Push(1);

20
docs/zh/chapter_tree/avl_tree.md
View File

@@ -238,9 +238,9 @@ AVL 树既是二叉搜索树也是平衡二叉树，同时满足这两类二叉
=== "C#"
```csharp title="avl_tree.cs"
[class]{AVLTree}-[func]{height}
[class]{AVLTree}-[func]{Height}
[class]{AVLTree}-[func]{updateHeight}
[class]{AVLTree}-[func]{UpdateHeight}
```
=== "Go"
@@ -332,7 +332,7 @@ AVL 树既是二叉搜索树也是平衡二叉树，同时满足这两类二叉
=== "C#"
```csharp title="avl_tree.cs"
[class]{AVLTree}-[func]{balanceFactor}
[class]{AVLTree}-[func]{BalanceFactor}
```
=== "Go"
@@ -436,7 +436,7 @@ AVL 树的特点在于“旋转”操作，它能够在不影响二叉树的中
=== "C#"
```csharp title="avl_tree.cs"
[class]{AVLTree}-[func]{rightRotate}
[class]{AVLTree}-[func]{RightRotate}
```
=== "Go"
@@ -520,7 +520,7 @@ AVL 树的特点在于“旋转”操作，它能够在不影响二叉树的中
=== "C#"
```csharp title="avl_tree.cs"
[class]{AVLTree}-[func]{leftRotate}
[class]{AVLTree}-[func]{LeftRotate}
```
=== "Go"
@@ -623,7 +623,7 @@ AVL 树的特点在于“旋转”操作，它能够在不影响二叉树的中
=== "C#"
```csharp title="avl_tree.cs"
[class]{AVLTree}-[func]{rotate}
[class]{AVLTree}-[func]{Rotate}
```
=== "Go"
@@ -707,9 +707,9 @@ AVL 树的节点插入操作与二叉搜索树在主体上类似。唯一的区
=== "C#"
```csharp title="avl_tree.cs"
[class]{AVLTree}-[func]{insert}
[class]{AVLTree}-[func]{Insert}
[class]{AVLTree}-[func]{insertHelper}
[class]{AVLTree}-[func]{InsertHelper}
```
=== "Go"
@@ -807,9 +807,9 @@ AVL 树的节点插入操作与二叉搜索树在主体上类似。唯一的区
=== "C#"
```csharp title="avl_tree.cs"
[class]{AVLTree}-[func]{remove}
[class]{AVLTree}-[func]{Remove}
[class]{AVLTree}-[func]{removeHelper}
[class]{AVLTree}-[func]{RemoveHelper}
```
=== "Go"

6
docs/zh/chapter_tree/binary_search_tree.md
View File

@@ -54,7 +54,7 @@
=== "C#"
```csharp title="binary_search_tree.cs"
[class]{BinarySearchTree}-[func]{search}
[class]{BinarySearchTree}-[func]{Search}
```
=== "Go"
@@ -140,7 +140,7 @@
=== "C#"
```csharp title="binary_search_tree.cs"
[class]{BinarySearchTree}-[func]{insert}
[class]{BinarySearchTree}-[func]{Insert}
```
=== "Go"
@@ -251,7 +251,7 @@
=== "C#"
```csharp title="binary_search_tree.cs"
[class]{BinarySearchTree}-[func]{remove}
[class]{BinarySearchTree}-[func]{Remove}
```
=== "Go"

12
docs/zh/chapter_tree/binary_tree.md
View File

@@ -271,11 +271,11 @@
```csharp title="binary_tree.cs"
/* 初始化二叉树 */
// 初始化节点
TreeNode n1 = new TreeNode(1);
TreeNode n2 = new TreeNode(2);
TreeNode n3 = new TreeNode(3);
TreeNode n4 = new TreeNode(4);
TreeNode n5 = new TreeNode(5);
TreeNode n1 = new(1);
TreeNode n2 = new(2);
TreeNode n3 = new(3);
TreeNode n4 = new(4);
TreeNode n5 = new(5);
// 构建引用指向（即指针）
n1.left = n2;
n1.right = n3;
@@ -451,7 +451,7 @@
```csharp title="binary_tree.cs"
/* 插入与删除节点 */
TreeNode P = new TreeNode(0);
TreeNode P = new(0);
// 在 n1 -> n2 中间插入节点 P
n1.left = P;
P.left = n2;

8
docs/zh/chapter_tree/binary_tree_traversal.md
View File

@@ -37,7 +37,7 @@
=== "C#"
```csharp title="binary_tree_bfs.cs"
[class]{binary_tree_bfs}-[func]{levelOrder}
[class]{binary_tree_bfs}-[func]{LevelOrder}
```
=== "Go"
@@ -138,11 +138,11 @@
=== "C#"
```csharp title="binary_tree_dfs.cs"
[class]{binary_tree_dfs}-[func]{preOrder}
[class]{binary_tree_dfs}-[func]{PreOrder}
[class]{binary_tree_dfs}-[func]{inOrder}
[class]{binary_tree_dfs}-[func]{InOrder}
[class]{binary_tree_dfs}-[func]{postOrder}
[class]{binary_tree_dfs}-[func]{PostOrder}
```
=== "Go"