This approach uses recursion and backtracking to generate all possible combinations by exploring each candidate. If a candidate is chosen, we explore further with the remaining target reduced by the candidate's value. We use backtracking to remove a candidate and try the next one. This way, we explore all possible combinations using depth-first search.
Time Complexity: O(2^T), where T is the target, as it potentially explores every combination of the candidates.
Space Complexity: O(T) for the recursion call stack and the path being explored.
1#include <stdio.h>
2#include <stdlib.h>
3#include <string.h>
4
5void findCombination(int* candidates, int candidatesSize, int target, int** result, int* returnColSize, int* returnSize, int* currentCombo, int currentComboSize, int startIndex) {
6 if (target < 0) return;
7 if (target == 0) {
8 result[*returnSize] = (int*)malloc(sizeof(int) * currentComboSize);
9 memcpy(result[*returnSize], currentCombo, sizeof(int) * currentComboSize);
10 returnColSize[*returnSize] = currentComboSize;
11 (*returnSize)++;
12 return;
13 }
14
15 for (int i = startIndex; i < candidatesSize; i++) {
16 currentCombo[currentComboSize] = candidates[i];
17 findCombination(candidates, candidatesSize, target - candidates[i], result, returnColSize, returnSize, currentCombo, currentComboSize + 1, i);
18 }
19}
20
21int** combinationSum(int* candidates, int candidatesSize, int target, int** columnSizes, int* returnSize) {
22 int** result = (int**)malloc(150 * sizeof(int*));
23 *columnSizes = (int*)malloc(150 * sizeof(int));
24 *returnSize = 0;
25 int* currentCombo = (int*)malloc(target * sizeof(int));
26 findCombination(candidates, candidatesSize, target, result, *columnSizes, returnSize, currentCombo, 0, 0);
27 free(currentCombo);
28 return result;
29}
30
31int main() {
32 int candidates[] = {2, 3, 6, 7};
33 int candidatesSize = 4;
34 int target = 7;
35 int* columnSizes;
36 int returnSize;
37 int** result = combinationSum(candidates, candidatesSize, target, &columnSizes, &returnSize);
38 for (int i = 0; i < returnSize; i++) {
39 printf("[");
40 for (int j = 0; j < columnSizes[i]; j++) {
41 printf("%d%s", result[i][j], j == columnSizes[i] - 1 ? "" : ", ");
42 }
43 printf("]\n");
44 free(result[i]);
45 }
46 free(result);
47 free(columnSizes);
48 return 0;
49}
50This C solution uses recursion to explore combinations and backtracks when a target less than zero is reached. If the target is zero, a valid combination is found and added to the result. The helper function findCombination iterates through candidates allowing reuse of the current candidate.
We can use a dynamic programming (DP) approach to solve the Combination Sum problem. We maintain a DP array where each index represents the number of ways to form that particular sum using the candidates. The approach involves iterating through candidates and updating the DP array for each possible sum that can be formed with that candidate.
Time Complexity: Roughly O(T * N), for target T and candidates N.
Space Complexity: O(T) for the dp array itself in context of storage.
1#include <iostream>
2#include <vector>
3
4using namespace std;
5
6vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
7 vector<vector<int>> dp[target + 1];
8 dp[0] = {{}}; // Base condition
9
10 for (int i = 1; i <= target; i++) {
11 for (const int& cand : candidates) {
12 if (i >= cand) {
13 for (auto& subResult : dp[i - cand]) {
14 dp[i].push_back(subResult);
15 dp[i].back().push_back(cand);
16 }
17 }
18 }
19 }
20
21 return dp[target];
22}
23
24int main() {
25 vector<int> candidates = {2, 3, 6, 7};
26 int target = 7;
27 vector<vector<int>> result = combinationSum(candidates, target);
28 for (const auto& comb : result) {
29 cout << "[";
30 for (int i = 0; i < comb.size(); ++i) {
31 cout << comb[i] << (i == comb.size() - 1 ? "" : ", ");
32 }
33 cout << "]\n";
34 }
35 return 0;
36}
37The C++ solution defines a DP table where each entry at index i stores all combinations that sum to i using combinations of previous entries combined with current candidates.