algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-26 20:04:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: add/refactor method in include, simplified print code (#471)

Browse Source
This commit is contained in:
hpstory
2023-04-21 14:59:22 +08:00
committed by GitHub
parent 9c2e5e2831
commit 9eeefff447
24 changed files with 102 additions and 109 deletions
Download Patch File Download Diff File Expand all files Collapse all files

60
codes/csharp/include/PrintUtil.cs
View File

@ -9,9 +9,9 @@ namespace hello_algo.include;
public class Trunk
{
public Trunk? prev;
public String str;
public string str;
public Trunk(Trunk? prev, String str)
public Trunk(Trunk? prev, string str)
{
this.prev = prev;
this.str = str;
@ -24,24 +24,46 @@ public class PrintUtil
* Print a list
* @param list
*/
public static void PrintList(List<int> list)
public static void PrintList<T>(List<T> list)
{
Console.WriteLine("[" + string.Join(", ", list) + "]");
}
/* Print a matrix (Array) */
public static void PrintMatrix<T>(T[][] matrix)
{
Console.WriteLine("[");
foreach (T[] row in matrix)
{
Console.WriteLine(" " + string.Join(", ", row) + ",");
}
Console.WriteLine("]");
}
/* Print a matrix (List) */
public static void PrintMatrix<T>(List<List<T>> matrix)
{
Console.WriteLine("[");
foreach (List<T> row in matrix)
{
Console.WriteLine(" " + string.Join(", ", row) + ",");
}
Console.WriteLine("]");
}
/**
* Print a linked list
* @param head
*/
public static void PrintLinkedList(ListNode head)
{
List<String> list = new();
List<string> list = new();
while (head != null)
{
list.Add(head.val.ToString());
head = head.next;
}
Console.Write(String.Join(" -> ", list));
Console.Write(string.Join(" -> ", list));
}
/**
@ -68,7 +90,7 @@ public class PrintUtil
return;
}
String prev_str = " ";
string prev_str = " ";
Trunk trunk = new Trunk(prev, prev_str);
PrintTree(root.right, trunk, true);
@ -88,7 +110,7 @@ public class PrintUtil
prev.str = prev_str;
}
showTrunks(trunk);
ShowTrunks(trunk);
Console.WriteLine(" " + root.val);
if (prev != null)
@ -104,14 +126,14 @@ public class PrintUtil
* Helper function to print branches of the binary tree
* @param p
*/
public static void showTrunks(Trunk? p)
public static void ShowTrunks(Trunk? p)
{
if (p == null)
{
return;
}
showTrunks(p.prev);
ShowTrunks(p.prev);
Console.Write(p.str);
}
@ -121,7 +143,7 @@ public class PrintUtil
* @param <V>
* @param map
*/
public static void printHashMap<K, V>(Dictionary<K, V> map) where K : notnull
public static void PrintHashMap<K, V>(Dictionary<K, V> map) where K : notnull
{
foreach (var kv in map.Keys)
{
@ -129,17 +151,17 @@ public class PrintUtil
}
}
public static void printHeap(Queue<int> queue)
public static void PrintHeap(Queue<int> queue)
{
Console.Write("堆的数组表示：");
List<int> list = queue.ToList();
Console.WriteLine(string.Join(',', list));
Console.WriteLine("堆的树状表示：");
TreeNode tree = TreeNode.ArrToTree(list.Cast<int?>().ToArray());
TreeNode tree = TreeNode.ListToTree(list.Cast<int?>().ToList());
PrintTree(tree);
}
public static void printHeap(PriorityQueue<int, int> queue)
public static void PrintHeap(PriorityQueue<int, int> queue)
{
var newQueue = new PriorityQueue<int, int>(queue.UnorderedItems, queue.Comparer);
Console.Write("堆的数组表示：");
@ -150,17 +172,7 @@ public class PrintUtil
}
Console.WriteLine("堆的树状表示：");
Console.WriteLine(string.Join(',', list.ToList()));
TreeNode tree = TreeNode.ArrToTree(list.Cast<int?>().ToArray());
TreeNode tree = TreeNode.ListToTree(list.Cast<int?>().ToList());
PrintTree(tree);
}
public static void printMatrix(List<List<int>> matrix)
{
Console.WriteLine("[");
foreach (List<int> row in matrix)
{
Console.WriteLine(" [" + string.Join(", ", row.Select(r => $"{r}")) + "],");
}
Console.WriteLine("]");
}
}