Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
Note:
- All numbers (including target) will be positive integers.
- Elements in a combination (a1, a2, � , ak) must be in non-descending order. (ie, a1 ? a2 ? � ? ak).
- The solution set must not contain duplicate combinations.
For example, given candidate set 10,1,2,7,6,1,5
and target 8
,
A solution set is: [1, 7]
[1, 2, 5]
[2, 6]
[1, 1, 6]
class Solution {
public:
vector<vector<int> > combinationSum2(vector<int> &num, int target) {
vector<vector<int> > ret;
if(target <= 0) return ret;
if(num.size() == 0) return ret;
sort(num.begin(), num.end());
vector<int> tmp;
iter(num, target, 0, tmp, ret);
return ret;
}
void iter(vector<int> &num, int target, int beg, vector<int> tmp, vector<vector<int> > &ret) {
if(target == 0) {
ret.push_back(tmp);
return;
}
if(target > 0) {
for(int i = beg; i < num.size(); ++i) {
if(i == beg || num[i] != num[i-1]) {
tmp.push_back(num[i]);
iter(num, target-num[i], i+1, tmp, ret);
tmp.pop_back();
}
}
}
}
};
欢迎关注微信公众号——计算机视觉