CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-14 10:20:40 +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

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"