leetcode[40]Combination Sum II
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: void searchTarget(vector<vector<int>> &res, vector<int> temp, vector<int> &candidates, int target, int index) { if (target==0)res.push_back(temp); else { for (int i=index;i<candidates.size();i++) { if(i!=index&&candidates[i]==candidates[i-1]) continue; if (target>=candidates[i]) { temp.push_back(candidates[i]); searchTarget(res,temp,candidates,target-candidates[i],i+1); temp.pop_back(); } } } } vector<vector<int>> combinationSum2(vector<int> &num, int target) { vector<vector<int>> res; vector<int> temp; sort(num.begin(),num.end()); searchTarget(res,temp,num,target,0); return res; } };