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

14
codes/csharp/chapter_backtracking/subset_sum_i.cs
View File

@@ -8,7 +8,7 @@ namespace hello_algo.chapter_backtracking;
public class subset_sum_i {
/* 回溯算法：子集和 I */
public static void backtrack(List<int> state, int target, int[] choices, int start, List<List<int>> res) {
public static void Backtrack(List<int> state, int target, int[] choices, int start, List<List<int>> res) {
// 子集和等于 target 时，记录解
if (target == 0) {
res.Add(new List<int>(state));
@@ -25,19 +25,19 @@ public class subset_sum_i {
// 尝试：做出选择，更新 target, start
state.Add(choices[i]);
// 进行下一轮选择
backtrack(state, target - choices[i], choices, i, res);
Backtrack(state, target - choices[i], choices, i, res);
// 回退：撤销选择，恢复到之前的状态
state.RemoveAt(state.Count - 1);
}
}
/* 求解子集和 I */
public static List<List<int>> subsetSumI(int[] nums, int target) {
List<int> state = new List<int>(); // 状态（子集）
public static List<List<int>> SubsetSumI(int[] nums, int target) {
List<int> state = new(); // 状态（子集）
Array.Sort(nums); // 对 nums 进行排序
int start = 0; // 遍历起始点
List<List<int>> res = new List<List<int>>(); // 结果列表（子集列表）
backtrack(state, target, nums, start, res);
List<List<int>> res = new(); // 结果列表（子集列表）
Backtrack(state, target, nums, start, res);
return res;
}
@@ -45,7 +45,7 @@ public class subset_sum_i {
public void Test() {
int[] nums = { 3, 4, 5 };
int target = 9;
List<List<int>> res = subsetSumI(nums, target);
List<List<int>> res = SubsetSumI(nums, target);
Console.WriteLine("输入数组 nums = " + string.Join(", ", nums) + ", target = " + target);
Console.WriteLine("所有和等于 " + target + " 的子集 res = ");
foreach (var subset in res) {