题目描述
Given a set of candidate numbers ( C ) 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.
- Elements in a combination (a 1, a 2, … , a k) must be in non-descending order. (ie, a 1 ≤ a 2 ≤ … ≤ a k).
- The solution set must not contain duplicate combinations.
For example, given candidate set2,3,6,7and target7,
A solution set is:
[7]
[2, 2, 3]
题目分析
题目大意是:有一个正整数集合C和一个正整数目标T。现从C中选出一些数,使其累加和恰好等于T(C中的每个数都可以取若干次),求所有不同的取数方案,是一道典型的深度优先搜索题。
题目的一个细节是,正整数集合C可能存在重复的数,而这些数用于组合时,会产生重复的排列组合,如下图所示,而题目要求:The solution set must not contain duplicate combinations.
实现代码:
class Solution {
public:
vector<vector<int>> result;
vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
vector<int> temp; // 用于存放临时组合
sort(candidates.begin(), candidates.end());
// 结果要求输出的组合不能重复,需要去除candidates中的重复元素
candidates.erase(unique(candidates.begin(), candidates.end()), candidates.end());
combinationDFS(candidates, temp, 0, target);
return result;
}
void combinationDFS(vector<int> &candidates, vector<int> &temp, int index, int target)
{
if (target == 0) // 得到满足目标的一组解
{
result.push_back(temp);
return;
}
else
{
for (int i = index; i < candidates.size(); ++i)
{
if (candidates[i] > target)
return;
temp.push_back(candidates[i]);
combinationDFS(candidates, temp, i, target - candidates[i]);//每次都是从i开始
temp.pop_back();
}
}
}
};