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

feat(csharp) .NET 8.0 code migration (#966)

Browse Source 
* .net 8.0 migration

* update docs

* revert change

* revert change and update appendix docs

* remove static

* Update binary_search_insertion.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
hpstory
2023-11-26 23:18:44 +08:00
committed by GitHub
parent d960c99a1f
commit 56b20eff36
93 changed files with 539 additions and 487 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/csharp/utils/PrintUtil.cs
+9 -14
View File
@@ -6,14 +6,9 @@
namespace hello_algo.utils;
public class Trunk {
public Trunk? prev;
public string str;
public Trunk(Trunk? prev, string str) {
this.prev = prev;
this.str = str;
}
public class Trunk(Trunk? prev, string str) {
public Trunk? prev = prev;
public string str = str;
};
public static class PrintUtil {
@@ -45,8 +40,8 @@ public static class PrintUtil {
}
/* Print a linked list */
public static void PrintLinkedList(ListNode head) {
List<string> list = new();
public static void PrintLinkedList(ListNode? head) {
List<string> list = [];
while (head != null) {
list.Add(head.val.ToString());
head = head.next;
@@ -115,10 +110,10 @@ public static class PrintUtil {
/* Print a heap */
public static void PrintHeap(Queue<int> queue) {
Console.Write("堆的数组表示：");
List<int> list = queue.ToList();
List<int> list = [.. queue];
Console.WriteLine(string.Join(',', list));
Console.WriteLine("堆的树状表示：");
TreeNode tree = TreeNode.ListToTree(list.Cast<int?>().ToList());
TreeNode? tree = TreeNode.ListToTree(list.Cast<int?>().ToList());
PrintTree(tree);
}
@@ -126,13 +121,13 @@ 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> list = [];
while (newQueue.TryDequeue(out int element, out _)) {
list.Add(element);
}
Console.WriteLine("堆的树状表示：");
Console.WriteLine(string.Join(',', list.ToList()));
TreeNode tree = TreeNode.ListToTree(list.Cast<int?>().ToList());
TreeNode? tree = TreeNode.ListToTree(list.Cast<int?>().ToList());
PrintTree(tree);
}
}