xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-11 06:56:06 +00: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
docs/zh/chapter_backtracking/backtracking_algorithm.md
+16 -16
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"
docs/zh/chapter_backtracking/n_queens_problem.md
+2 -2
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"
docs/zh/chapter_backtracking/permutations_problem.md
+4 -4
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"
docs/zh/chapter_backtracking/subset_sum_problem.md
+6 -6
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"