原题链接:https://leetcode.com/problems/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]
]
题目大概的意思就是给定一个数的集合,然后给定一个目标数,然后从这个数的集合里选出一些数的组合,使得这些数的和恰好等于这个目标数。从这里我们就可以联想到相似的背包问题,但有一点不同的是,这里可以允许重复取值,即可以从集合中重复取出同一个值来满足和为目标数的要求。
这个问题可以对背包问题的算法进行改进,每次从集合中取出一个数时,通过递归进入另外一个函数时,还是从原集合中进行选取,不必再从删掉一个值的集合中选取,当目标值恰好为0时,就产生了问题的一个解,然后就把最后一个放进去的值拿出来,再递归求出问题的所有解。
代码如下:
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();
}
}
};