xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-08 05:26:07 +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_computational_complexity/space_complexity.md
+17 -17
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"