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 (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 2,3,6,7
and target 7
,
A solution set is:
[7]
[2, 2, 3]
分析:和Two sum题目很像,不过Two sums是要找两个数和为target, 而这里是要解2a + 3b + 6c + 7d = 7的所有解 (a, b , c, d) .根据2a <= 7可以求出a的选择为{0, 1, 2, 3}; b的选择为{0, 1, 2}; c的选择为{0, 1}; d的选择为{0, 1}。
由上述分析可知,a有四种选择,得到一个四叉链;b有三种选择得到一个三叉链;c和d都为二叉链。这里构造了树形结构很明显可以用DFS,时间复杂度略高,应该可以优化。
class Solution {
vector<vector<int> > ret;
public:
vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
int size = candidates.size();
if(size == 0) return vector<vector<int> >();
//计算每个解的范围
vector<int> range;
for(int i = 0; i < size; i++) {
int max = target / candidates[i];
range.push_back(max);
}
//DFS求解
vector<int> item;
DFS(candidates, range, 0, item, 0, target);
return ret;
}
void DFS(vector<int> &candidates, vector<int> &range, int level, vector<int> &item, int sum, int target) {
if(level == candidates.size()) {
if(sum == target) {
vector<int> solve;
for(int i = 0; i < level; i++) {
for(int j = 0; j < item[i]; j++) {
solve.push_back(candidates[i]);
}
}
ret.push_back(solve);
return ;
}
} else {
for(int i = 0; i <= range[level]; i++) {
item.push_back(i);
DFS(candidates, range, level + 1, item, sum + candidates[level] * i, target);
item.pop_back();
}
}
}
};
改进即可Aceept:在DFS中加入 if(sum > target) return ;
继续改进如下:
class Solution {
vector<vector<int> > ret;
public:
void DFS(vector<int> &candidates, int level, vector<int> &item, int target) {
if(level == candidates.size()) {
if(target == 0) {
ret.push_back(item);
return ;
}
} else {
for(int i = target / candidates[level]; i >= 0; i--) {
item.push_back(candidates[level]);
}
for(int i = target / candidates[level]; i >= 0; i--) {
item.pop_back();
DFS(candidates, level + 1, item, target - i * candidates[level]);
}
}
}
vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
int size = candidates.size();
if(size == 0) return vector<vector<int> >();
sort(candidates.begin(), candidates.end());
vector<int>::iterator pos = unique(candidates.begin(), candidates.end());
candidates.erase(pos, candidates.end());
//DFS求解
vector<int> item;
DFS(candidates, 0, item, target);
return ret;
}
};