xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-13 15:56:05 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix code naming style.

Browse Source
This commit is contained in:
krahets
2023-10-15 21:18:09 +08:00
parent ada37fd1f8
commit 346c8451de
23 changed files with 51 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/chapter_array_and_linkedlist/linked_list.md
+2 -2
View File
@@ -512,7 +512,7 @@
=== "Go"
```go title="linked_list.go"
[class]{}-[func]{removeNode}
[class]{}-[func]{removeItem}
```
=== "Swift"
@@ -548,7 +548,7 @@
=== "C"
```c title="linked_list.c"
[class]{}-[func]{removeNode}
[class]{}-[func]{removeItem}
```
=== "Zig"
docs/chapter_divide_and_conquer/binary_search_recur.md
+1 -1
View File
@@ -67,7 +67,7 @@
=== "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}
```
docs/chapter_divide_and_conquer/build_binary_tree_problem.md
+1 -1
View File
@@ -84,7 +84,7 @@
=== "C#"
```csharp title="build_tree.cs"
[class]{build_tree}-[func]{Dfs}
[class]{build_tree}-[func]{DFS}
[class]{build_tree}-[func]{BuildTree}
```
docs/chapter_divide_and_conquer/hanota_problem.md
+1 -1
View File
@@ -117,7 +117,7 @@
```csharp title="hanota.cs"
[class]{hanota}-[func]{Move}
[class]{hanota}-[func]{Dfs}
[class]{hanota}-[func]{DFS}
[class]{hanota}-[func]{SolveHanota}
```
docs/chapter_dynamic_programming/intro_to_dynamic_programming.md
+2 -2
View File
@@ -163,7 +163,7 @@ $$
=== "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}
```
@@ -274,7 +274,7 @@ $$
=== "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}
```
docs/chapter_graph/graph_traversal.md
+1 -1
View File
@@ -174,7 +174,7 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
=== "C#"
```csharp title="graph_dfs.cs"
[class]{graph_dfs}-[func]{Dfs}
[class]{graph_dfs}-[func]{DFS}
[class]{graph_dfs}-[func]{GraphDFS}
```
docs/chapter_tree/avl_tree.md
+1 -1
View File
@@ -863,7 +863,7 @@ AVL 树的节点插入操作与二叉搜索树在主体上类似。唯一的区
=== "C"
```c title="avl_tree.c"
[class]{aVLTree}-[func]{removeNode}
[class]{aVLTree}-[func]{removeItem}
[class]{}-[func]{removeHelper}
```
docs/chapter_tree/binary_search_tree.md
+1 -1
View File
@@ -293,7 +293,7 @@
=== "C"
```c title="binary_search_tree.c"
[class]{binarySearchTree}-[func]{removeNode}
[class]{binarySearchTree}-[func]{removeItem}
```
=== "Zig"