Combination Sum

问题描述：

Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

The same repeated number may be chosen from C unlimited number of times.

Note:
All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
For example, given candidate set [2, 3, 6, 7] and target 7,
A solution set is:
[
[7],
[2, 2, 3]
]

测试代码：

class Solution {
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
vector<vector<int>> solutions;
vector<int> solution;
sort(candidates.begin(), candidates.end());

backtrack(solutions, candidates, solution, target, 0);
return solutions;
}

void backtrack(vector<vector<int>> &solutions, vector<int> &candidates,
vector<int> &solution, int target, int idx)
{
for (; idx < candidates.size(); idx++)
{
int new_target = target - candidates[idx];
solution.push_back(candidates[idx]);
if (new_target == 0)
{
solutions.push_back(solution);
solution.pop_back();
return;
}
else if (new_target > 0)
{
backtrack(solutions, candidates, solution, new_target, idx);
solution.pop_back();
}
else
{
solution.pop_back();
return;
}
}
}
};

参考答案：

class Solution {
public:
std::vector<std::vector<int> > combinationSum(std::vector<int> &candidates, int target) {
std::sort(candidates.begin(), candidates.end());
std::vector<std::vector<int> > res;
std::vector<int> combination;
combinationSum(candidates, target, res, combination, 0);
return res;
}
private:
void combinationSum(std::vector<int> &candidates, int target, std::vector<std::vector<int> > &res, std::vector<int> &combination, int begin) {
if (!target) {
res.push_back(combination);
return;
}
for (int i = begin; i != candidates.size() && target >= candidates[i]; ++i) {
combination.push_back(candidates[i]);
combinationSum(candidates, target - candidates[i], res, combination, i);
combination.pop_back();
}
}
};