题目:
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]
思路:递归寻找所有可能。由于一个元素只能用一次,所以递归不能重复调用自身。去重的方法是,假设当前元素是num[i]的值为A,那么当列举完所有A后面的可能后,下一个元素必须不为A,不然就会有重复。
class Solution {
public:
int sum;
vector<int> trace;
void combination_helper(const vector<int>& num, int target,
int pos, vector<vector<int>>& result) {
if (sum > target) return;
if (sum == target) {
result.push_back(trace);
return;
}
for (int i = pos; i < (int)num.size(); ++i) {
trace.push_back(num[i]);
sum += num[i];
combination_helper(num, target, i + 1, result);
sum -= num[i];
trace.pop_back();
//discard duplicates
while (i < (int)num.size() - 1 && num[i] == num[i+1]) i++;
}
}
vector<vector<int> > combinationSum2(vector<int> &num, int target) {
vector<vector<int>> result;
sort(num.begin(), num.end());
sum = 0;
combination_helper(num, target, 0, result);
return result;
}
};
总结:复杂度为O(2^n).