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

11
codes/csharp/utils/TreeNode.cs
View File

@ -39,9 +39,10 @@ public class TreeNode {
if (i < 0 || i >= arr.Count || !arr[i].HasValue) {
return null;
}
TreeNode root = new TreeNode(arr[i].Value);
root.left = ListToTreeDFS(arr, 2 * i + 1);
root.right = ListToTreeDFS(arr, 2 * i + 2);
TreeNode root = new(arr[i].Value) {
left = ListToTreeDFS(arr, 2 * i + 1),
right = ListToTreeDFS(arr, 2 * i + 2)
};
return root;
}
@ -63,8 +64,8 @@ public class TreeNode {
}
/* 将二叉树序列化为列表 */
public static List<int?> treeToList(TreeNode root) {
List<int?> res = new List<int?>();
public static List<int?> TreeToList(TreeNode root) {
List<int?> res = new();
TreeToListDFS(root, 0, res);
return res;
}