# Concise C++ solution of combination sum2/ 8 ms

• `````` 只需要在combination sum的基础上做一点改动，借鉴了别人的combination sum代码

class Solution {//递归8ms
public:
vector<vector<int> > combinationSum2(vector<int> &candidates, int target) {
sort(candidates.begin(), candidates.end());
vector<vector<int> > res;
vector<int> combination;
combinationSum(candidates, target, res, combination, 0);//递归，找到和为target的所有组合
//auto end_unique = unique(res.begin(),res.end());
//res.erase(end_unique,res.end());
return res;
}
private:
void combinationSum(vector<int> &candidates, int target, vector<vector<int> > &res, vector<int> &combination, int begin) {
if  (!target) {
res.push_back(combination);
return;
}
for (int i = begin; i != candidates.size() && target >= candidates[i];++i) {//每循环一次结束，combination置0
combination.push_back(candidates[i]);
combinationSum(candidates, target - candidates[i], res, combination, i+1);
combination.pop_back();
while(candidates[i]==candidates[i+1]) i++;
}
}
};``````

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.