/** * File: subset_sum_i.cs * Created Time: 2023-06-25 * Author: hpstory (hpstory1024@163.com) */ namespace hello_algo.chapter_backtracking; public class subset_sum_i { /* Backtracking algorithm: Subset Sum I */ void Backtrack(List state, int target, int[] choices, int start, List> res) { // When the subset sum equals target, record the solution if (target == 0) { res.Add(new List(state)); return; } // Traverse all choices // Pruning two: start traversing from start to avoid generating duplicate subsets for (int i = start; i < choices.Length; i++) { // Pruning one: if the subset sum exceeds target, end the loop immediately // This is because the array is sorted, and later elements are larger, so the subset sum will definitely exceed target if (target - choices[i] < 0) { break; } // Attempt: make a choice, update target, start state.Add(choices[i]); // Proceed to the next round of selection Backtrack(state, target - choices[i], choices, i, res); // Retract: undo the choice, restore to the previous state state.RemoveAt(state.Count - 1); } } /* Solve Subset Sum I */ List> SubsetSumI(int[] nums, int target) { List state = []; // State (subset) Array.Sort(nums); // Sort nums int start = 0; // Start point for traversal List> res = []; // Result list (subset list) Backtrack(state, target, nums, start, res); return res; } [Test] public void Test() { int[] nums = [3, 4, 5]; int target = 9; List> res = SubsetSumI(nums, target); Console.WriteLine("Input array nums = " + string.Join(", ", nums) + ", target = " + target); Console.WriteLine("All subsets summing to " + target + " res ="); foreach (var subset in res) { PrintUtil.PrintList(subset); } } }