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

Add C# code for the chapter Heap and Graph (#324)

Browse Source 
* add : C# heap ,graph, fix type "sift"=>"shift"

* chore: rename "shift" to "sift"

* add: heap,graph C# sample code ,fix format

* fix md format

* fix md intend foramt

* fix basic_operation_of_graph.md format

* fix md format

* fix md format

* fix indentation format

* chore: fix my_heap.cs test

* fix: test and doc typo

* fix bug for commit 5eae708 (#317)

* Add Zig code blocks.

* fix: resolve build error for commit 5eae708 (#318)

* Unify the function naming of
queue from `offer()` to `push()`

* Update TypeScript codes.

* Update binary_search_tree

* Update graph operations.

* Fix code indentation.

* Update worst_best_time_complexity,
leetcode_two_sum

* Update avl_tree

* copy zig codes of chapter_array_and_linkedlist and chapter_computatio… (#319)

* copy zig codes of chapter_array_and_linkedlist and chapter_computational_complexity to markdown files

* Update time_complexity.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>

* Fix Python code styles.
Update hash_map.

* chore: fix heap logic

* Update graph_adjacency_matrix.cs

* Update graph_adjacency_matrix.cs

* Update my_heap.cs

* fix: heap test

* fix naming format

* merge markdown

* fix markdown format

* Update graph_adjacency_list.cs

* Update graph_adjacency_matrix.cs

* Update PrintUtil.cs

* Create Vertex.cs

* Update heap.cs

---------

Co-authored-by: zjkung1123 <zjkung1123@fugle.tw>
Co-authored-by: sjinzh <99076655+sjinzh@users.noreply.github.com>
Co-authored-by: Yudong Jin <krahets@163.com>
Co-authored-by: nuomi1 <nuomi1@qq.com>
This commit is contained in:
ZJKung
2023-02-15 21:24:24 +08:00
committed by GitHub
parent a383cb7ddf
commit f0b092fec4
7 changed files with 652 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1,8 +1,8 @@
/**
* File: PrintUtil.cs
* Created Time: 2022-12-23
* Author: haptear (haptear@hotmail.com)
*/
/**
* File: PrintUtil.cs
* Created Time: 2022-12-23
* Author: haptear (haptear@hotmail.com), krahets (krahets@163.com)
*/
namespace hello_algo.include;
@ -20,6 +20,15 @@ public class Trunk
public class PrintUtil
{
/**
* Print a list
* @param list
*/
public static void PrintList(List<int> list)
{
Console.WriteLine("[" + string.Join(", ", list) + "]");
}
/**
* Print a linked list
* @param head
@ -119,4 +128,39 @@ public class PrintUtil
Console.WriteLine(kv.ToString() + " -> " + map[kv]?.ToString());
}
}
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());
PrintTree(tree);
}
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.Add(element);
}
Console.WriteLine("堆的树状表示：");
Console.WriteLine(string.Join(',', list.ToList()));
TreeNode tree = TreeNode.ArrToTree(list.Cast<int?>().ToArray());
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("]");
}
}