获取目标求和的数字组合- C#

using System;
using System.Collections.Generic;

public class Solution {
    public IList<IList<int>> CombinationSum(int[] candidates, int target) {
        IList<IList<int>> result = new List<IList<int>>();
        List<int> combination = new List<int>();
        Array.Sort(candidates); // 对数组进行排序，方便后续剪枝操作
        Backtrack(result, combination, candidates, target, 0);
        return result;
    }
    
    private void Backtrack(IList<IList<int>> result, List<int> combination, int[] candidates, int target, int start) {
        if (target == 0) {
            result.Add(new List<int>(combination)); // 找到一个组合满足目标和，将其加入结果集
            return;
        }
        for (int i = start; i < candidates.Length; i++) {
            if (candidates[i] > target) {
                break; // 当前数字大于目标和，剪枝操作，结束循环
            }
            combination.Add(candidates[i]); // 将当前数字加入组合
            Backtrack(result, combination, candidates, target - candidates[i], i); // 递归调用，继续寻找下一个数字
            combination.RemoveAt(combination.Count - 1); // 回溯操作，将当前数字移出组合
        }
    }
}

public class Program {
    public static void Main(string[] args) {
        Solution solution = new Solution();
        int[] candidates = {2, 3, 6, 7};
        int target = 7;
        IList<IList<int>> result = solution.CombinationSum(candidates, target);
        foreach (IList<int> combination in result) {
            Console.WriteLine(string.Join(", ", combination));
        }
    }
}