algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +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

6
codes/csharp/utils/PrintUtil.cs
View File

@ -70,7 +70,7 @@ public static class PrintUtil {
}
string prev_str = " ";
Trunk trunk = new Trunk(prev, prev_str);
Trunk trunk = new(prev, prev_str);
PrintTree(root.right, trunk, true);
@ -126,8 +126,8 @@ public static class PrintUtil {
public static void PrintHeap(PriorityQueue<int, int> queue) {
var newQueue = new PriorityQueue<int, int>(queue.UnorderedItems, queue.Comparer);
Console.Write("堆的数组表示：");
List<int> list = new List<int>();
while (newQueue.TryDequeue(out int element, out int priority)) {
List<int> list = new();
while (newQueue.TryDequeue(out int element, out _)) {
list.Add(element);
}
Console.WriteLine("堆的树状表示：");