CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-14 02:10:37 +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

12
codes/csharp/chapter_divide_and_conquer/binary_search_recur.cs
View File

@@ -8,7 +8,7 @@ namespace hello_algo.chapter_divide_and_conquer;
public class binary_search_recur {
/* 二分查找：问题 f(i, j) */
public int dfs(int[] nums, int target, int i, int j) {
public int Dfs(int[] nums, int target, int i, int j) {
// 若区间为空，代表无目标元素，则返回 -1
if (i > j) {
return -1;
@@ -17,10 +17,10 @@ public class binary_search_recur {
int m = (i + j) / 2;
if (nums[m] < target) {
// 递归子问题 f(m+1, j)
return dfs(nums, target, m + 1, j);
return Dfs(nums, target, m + 1, j);
} else if (nums[m] > target) {
// 递归子问题 f(i, m-1)
return dfs(nums, target, i, m - 1);
return Dfs(nums, target, i, m - 1);
} else {
// 找到目标元素，返回其索引
return m;
@@ -28,10 +28,10 @@ public class binary_search_recur {
}
/* 二分查找 */
public int binarySearch(int[] nums, int target) {
public int BinarySearch(int[] nums, int target) {
int n = nums.Length;
// 求解问题 f(0, n-1)
return dfs(nums, target, 0, n - 1);
return Dfs(nums, target, 0, n - 1);
}
[Test]
@@ -40,7 +40,7 @@ public class binary_search_recur {
int[] nums = { 1, 3, 6, 8, 12, 15, 23, 26, 31, 35 };
// 二分查找（双闭区间）
int index = binarySearch(nums, target);
int index = BinarySearch(nums, target);
Console.WriteLine("目标元素 6 的索引 = " + index);
}
}

16
codes/csharp/chapter_divide_and_conquer/build_tree.cs
View File

@@ -8,30 +8,30 @@ namespace hello_algo.chapter_divide_and_conquer;
public class build_tree {
/* 构建二叉树：分治 */
public TreeNode dfs(int[] preorder, Dictionary<int, int> inorderMap, int i, int l, int r) {
public TreeNode Dfs(int[] preorder, Dictionary<int, int> inorderMap, int i, int l, int r) {
// 子树区间为空时终止
if (r - l < 0)
return null;
// 初始化根节点
TreeNode root = new TreeNode(preorder[i]);
TreeNode root = new(preorder[i]);
// 查询 m ，从而划分左右子树
int m = inorderMap[preorder[i]];
// 子问题：构建左子树
root.left = dfs(preorder, inorderMap, i + 1, l, m - 1);
root.left = Dfs(preorder, inorderMap, i + 1, l, m - 1);
// 子问题：构建右子树
root.right = dfs(preorder, inorderMap, i + 1 + m - l, m + 1, r);
root.right = Dfs(preorder, inorderMap, i + 1 + m - l, m + 1, r);
// 返回根节点
return root;
}
/* 构建二叉树 */
public TreeNode buildTree(int[] preorder, int[] inorder) {
public TreeNode BuildTree(int[] preorder, int[] inorder) {
// 初始化哈希表，存储 inorder 元素到索引的映射
Dictionary<int, int> inorderMap = new Dictionary<int, int>();
Dictionary<int, int> inorderMap = new();
for (int i = 0; i < inorder.Length; i++) {
inorderMap.TryAdd(inorder[i], i);
}
TreeNode root = dfs(preorder, inorderMap, 0, 0, inorder.Length - 1);
TreeNode root = Dfs(preorder, inorderMap, 0, 0, inorder.Length - 1);
return root;
}
@@ -42,7 +42,7 @@ public class build_tree {
Console.WriteLine("前序遍历 = " + string.Join(", ", preorder));
Console.WriteLine("中序遍历 = " + string.Join(", ", inorder));
TreeNode root = buildTree(preorder, inorder);
TreeNode root = BuildTree(preorder, inorder);
Console.WriteLine("构建的二叉树为：");
PrintUtil.PrintTree(root);
}

24
codes/csharp/chapter_divide_and_conquer/hanota.cs
View File

@@ -8,7 +8,7 @@ namespace hello_algo.chapter_divide_and_conquer;
public class hanota {
/* 移动一个圆盘 */
public void move(List<int> src, List<int> tar) {
public void Move(List<int> src, List<int> tar) {
// 从 src 顶部拿出一个圆盘
int pan = src[^1];
src.RemoveAt(src.Count - 1);
@@ -17,39 +17,39 @@ public class hanota {
}
/* 求解汉诺塔：问题 f(i) */
public void dfs(int i, List<int> src, List<int> buf, List<int> tar) {
public void Dfs(int i, List<int> src, List<int> buf, List<int> tar) {
// 若 src 只剩下一个圆盘，则直接将其移到 tar
if (i == 1) {
move(src, tar);
Move(src, tar);
return;
}
// 子问题 f(i-1) ：将 src 顶部 i-1 个圆盘借助 tar 移到 buf
dfs(i - 1, src, tar, buf);
Dfs(i - 1, src, tar, buf);
// 子问题 f(1) ：将 src 剩余一个圆盘移到 tar
move(src, tar);
Move(src, tar);
// 子问题 f(i-1) ：将 buf 顶部 i-1 个圆盘借助 src 移到 tar
dfs(i - 1, buf, src, tar);
Dfs(i - 1, buf, src, tar);
}
/* 求解汉诺塔 */
public void solveHanota(List<int> A, List<int> B, List<int> C) {
public void SolveHanota(List<int> A, List<int> B, List<int> C) {
int n = A.Count;
// 将 A 顶部 n 个圆盘借助 B 移到 C
dfs(n, A, B, C);
Dfs(n, A, B, C);
}
[Test]
public void Test() {
// 列表尾部是柱子顶部
List<int> A = new List<int> { 5, 4, 3, 2, 1 };
List<int> B = new List<int>();
List<int> C = new List<int>();
List<int> A = new() { 5, 4, 3, 2, 1 };
List<int> B = new();
List<int> C = new();
Console.WriteLine("初始状态下：");
Console.WriteLine("A = " + string.Join(", ", A));
Console.WriteLine("B = " + string.Join(", ", B));
Console.WriteLine("C = " + string.Join(", ", C));
solveHanota(A, B, C);
SolveHanota(A, B, C);
Console.WriteLine("圆盘移动完成后：");
Console.WriteLine("A = " + string.Join(", ", A));