# Combination-Sum

Oct 12, 2017

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]
]

vector<int> cand;
vector<vector<int> > ret;
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
cand = candidates;
sort(cand.begin(),cand.end());
vector<int> now;
combinationSumIter(now,0,target);
return ret;
}
void combinationSumIter(vector<int> &now,int beg,int target){
//cout << "target" << target << endl;
for(int i = beg;i < cand.size();++i) {
if (target < cand[i])
break;
else if (target == cand[i]) {
vector<int> vec = now;
vec.push_back(cand[i]);
ret.push_back(vec);
} else if (target - cand[i] >= cand[0] ){
vector<int> vec = now;
vec.push_back(cand[i]);
combinationSumIter(vec,i,target-cand[i]);
}
}
}

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();
}
}
};
LeetCodeLeetCode

Permutations

Search for a Range