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

Reformat the C# codes.

Browse Source 
Disable creating new line before open brace.
This commit is contained in:
krahets
2023-04-23 03:03:12 +08:00
parent ac6eece4f3
commit 73dcb4cea9
49 changed files with 561 additions and 1135 deletions
Download Patch File Download Diff File Expand all files Collapse all files

45
codes/csharp/include/ListNode.cs
View File

@ -4,61 +4,38 @@
namespace hello_algo.include;
/// <summary>
/// Definition for a singly-linked list node
/// </summary>
public class ListNode
{
/* Definition for a singly-linked list node */
public class ListNode {
public int val;
public ListNode? next;
/// <summary>
/// Generate a linked list with an array
/// </summary>
/// <param name="x"></param>
public ListNode(int x)
{
public ListNode(int x) {
val = x;
}
/// <summary>
/// Generate a linked list with an array
/// </summary>
/// <param name="arr"></param>
/// <returns></returns>
public static ListNode? ArrToLinkedList(int[] arr)
{
/* Generate a linked list with an array */
public static ListNode? ArrToLinkedList(int[] arr) {
ListNode dum = new ListNode(0);
ListNode head = dum;
foreach (int val in arr)
{
foreach (int val in arr) {
head.next = new ListNode(val);
head = head.next;
}
return dum.next;
}
/// <summary>
/// Get a list node with specific value from a linked list
/// </summary>
/// <param name="head"></param>
/// <param name="val"></param>
/// <returns></returns>
public static ListNode? GetListNode(ListNode? head, int val)
{
while (head != null && head.val != val)
{
/* Get a list node with specific value from a linked list */
public static ListNode? GetListNode(ListNode? head, int val) {
while (head != null && head.val != val) {
head = head.next;
}
return head;
}
public override string? ToString()
{
public override string? ToString() {
List<string> list = new();
var head = this;
while (head != null)
{
while (head != null) {
list.Add(head.val.ToString());
head = head.next;
}

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

@ -6,60 +6,44 @@
namespace hello_algo.include;
public class Trunk
{
public class Trunk {
public Trunk? prev;
public string str;
public Trunk(Trunk? prev, string str)
{
public Trunk(Trunk? prev, string str) {
this.prev = prev;
this.str = str;
}
};
public class PrintUtil
{
/**
* Print a list
* @param list
*/
public static void PrintList<T>(List<T> list)
{
public class PrintUtil {
/* Print a 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)
{
public static void PrintMatrix<T>(T[][] matrix) {
Console.WriteLine("[");
foreach (T[] row in matrix)
{
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)
{
public static void PrintMatrix<T>(List<List<T>> matrix) {
Console.WriteLine("[");
foreach (List<T> row in matrix)
{
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)
{
/* Print a linked list */
public static void PrintLinkedList(ListNode head) {
List<string> list = new();
while (head != null)
{
while (head != null) {
list.Add(head.val.ToString());
head = head.next;
}
@ -70,23 +54,14 @@ public class PrintUtil
* The interface of the tree printer
* This tree printer is borrowed from TECHIE DELIGHT
* https://www.techiedelight.com/c-program-print-binary-tree/
* @param root
*/
public static void PrintTree(TreeNode? root)
{
public static void PrintTree(TreeNode? root) {
PrintTree(root, null, false);
}
/**
* Print a binary tree
* @param root
* @param prev
* @param isLeft
*/
public static void PrintTree(TreeNode? root, Trunk? prev, bool isLeft)
{
if (root == null)
{
/* Print a binary tree */
public static void PrintTree(TreeNode? root, Trunk? prev, bool isLeft) {
if (root == null) {
return;
}
@ -95,17 +70,12 @@ public class PrintUtil
PrintTree(root.right, trunk, true);
if (prev == null)
{
if (prev == null) {
trunk.str = "———";
}
else if (isLeft)
{
} else if (isLeft) {
trunk.str = "/———";
prev_str = " |";
}
else
{
} else {
trunk.str = "\\———";
prev.str = prev_str;
}
@ -113,8 +83,7 @@ public class PrintUtil
ShowTrunks(trunk);
Console.WriteLine(" " + root.val);
if (prev != null)
{
if (prev != null) {
prev.str = prev_str;
}
trunk.str = " |";
@ -122,14 +91,9 @@ public class PrintUtil
PrintTree(root.left, trunk, false);
}
/**
* Helper function to print branches of the binary tree
* @param p
*/
public static void ShowTrunks(Trunk? p)
{
if (p == null)
{
/* Helper function to print branches of the binary tree */
public static void ShowTrunks(Trunk? p) {
if (p == null) {
return;
}
@ -137,22 +101,15 @@ public class PrintUtil
Console.Write(p.str);
}
/**
* Print a hash map
* @param <K>
* @param <V>
* @param map
*/
public static void PrintHashMap<K, V>(Dictionary<K, V> map) where K : notnull
{
foreach (var kv in map.Keys)
{
/* Print a hash map */
public static void PrintHashMap<K, V>(Dictionary<K, V> map) where K : notnull {
foreach (var kv in map.Keys) {
Console.WriteLine(kv.ToString() + " -> " + map[kv]?.ToString());
}
}
public static void PrintHeap(Queue<int> queue)
{
/* Print a heap */
public static void PrintHeap(Queue<int> queue) {
Console.Write("堆的数组表示：");
List<int> list = queue.ToList();
Console.WriteLine(string.Join(',', list));
@ -161,13 +118,12 @@ public class PrintUtil
PrintTree(tree);
}
public static void PrintHeap(PriorityQueue<int, int> queue)
{
/* Print a PriorityQueue */
public static void PrintHeap(PriorityQueue<int, int> queue) {
var newQueue = new PriorityQueue<int, int>(queue.UnorderedItems, queue.Comparer);
Console.Write("堆的数组表示：");
Console.Write("堆的数组表示：");
List<int> list = new List<int>();
while (newQueue.TryDequeue(out int element, out int priority))
{
while (newQueue.TryDequeue(out int element, out int priority)) {
list.Add(element);
}
Console.WriteLine("堆的树状表示：");

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

@ -6,25 +6,19 @@
namespace hello_algo.include;
public class TreeNode
{
/* 二叉树节点类 */
public class TreeNode {
public int val; // 节点值
public int height; // 节点高度
public TreeNode? left; // 左子节点引用
public TreeNode? right; // 右子节点引用
public TreeNode(int x)
{
public TreeNode(int x) {
val = x;
}
/**
* Generate a binary tree given an array
* @param arr
* @return
*/
public static TreeNode? ListToTree(List<int?> arr)
{
/* Generate a binary tree given an array */
public static TreeNode? ListToTree(List<int?> arr) {
if (arr.Count == 0 || arr[0] == null)
return null;
@ -32,18 +26,15 @@ public class TreeNode
Queue<TreeNode> queue = new Queue<TreeNode>();
queue.Enqueue(root);
int i = 0;
while (queue.Count != 0)
{
while (queue.Count != 0) {
TreeNode node = queue.Dequeue();
if (++i >= arr.Count) break;
if (arr[i] != null)
{
if (arr[i] != null) {
node.left = new TreeNode((int)arr[i]);
queue.Enqueue(node.left);
}
if (++i >= arr.Count) break;
if (arr[i] != null)
{
if (arr[i] != null) {
node.right = new TreeNode((int)arr[i]);
queue.Enqueue(node.right);
}
@ -51,41 +42,26 @@ public class TreeNode
return root;
}
/**
* Serialize a binary tree to a list
* @param root
* @return
*/
public static List<int?> TreeToList(TreeNode root)
{
/* Serialize a binary tree to a list */
public static List<int?> TreeToList(TreeNode root) {
List<int?> list = new();
if (root == null) return list;
Queue<TreeNode?> queue = new();
while (queue.Count != 0)
{
while (queue.Count != 0) {
TreeNode? node = queue.Dequeue();
if (node != null)
{
if (node != null) {
list.Add(node.val);
queue.Enqueue(node.left);
queue.Enqueue(node.right);
}
else
{
} else {
list.Add(null);
}
}
return list;
}
/**
* Get a tree node with specific value in a binary tree
* @param root
* @param val
* @return
*/
public static TreeNode? GetTreeNode(TreeNode? root, int val)
{
/* Get a tree node with specific value in a binary tree */
public static TreeNode? GetTreeNode(TreeNode? root, int val) {
if (root == null)
return null;
if (root.val == val)

18
codes/csharp/include/Vertex.cs
View File

@ -7,31 +7,25 @@
namespace hello_algo.include;
/* 顶点类 */
public class Vertex
{
public class Vertex {
public int val;
public Vertex(int val)
{
public Vertex(int val) {
this.val = val;
}
/* 输入值列表 vals ，返回顶点列表 vets */
public static Vertex[] ValsToVets(int[] vals)
{
public static Vertex[] ValsToVets(int[] vals) {
Vertex[] vets = new Vertex[vals.Length];
for (int i = 0; i < vals.Length; i++)
{
for (int i = 0; i < vals.Length; i++) {
vets[i] = new Vertex(vals[i]);
}
return vets;
}
/* 输入顶点列表 vets ，返回值列表 vals */
public static List<int> VetsToVals(List<Vertex> vets)
{
public static List<int> VetsToVals(List<Vertex> vets) {
List<int> vals = new List<int>();
foreach (Vertex vet in vets)
{
foreach (Vertex vet in vets) {
vals.Add(vet.val);
}
return vals;