【LeetCode】40. Combination Sum II

Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

Each number in candidates may only be used once in the combination.

Note:

• All numbers (including target) will be positive integers.
• The solution set must not contain duplicate combinations.

Example 1:

Input: candidates = [10,1,2,7,6,1,5], target = 8,
A solution set is:
[
  [1, 7],
  [1, 2, 5],
  [2, 6],
  [1, 1, 6]
]

Example 2:

Input: candidates = [2,5,2,1,2], target = 5,
A solution set is:
[
  [1,2,2],
  [5]
]

这道题跟39有一点区别，每个元素只能用一次。

class Solution {
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<int> oneResult;
        vector<vector<int>> res;
        sort(candidates.begin(),candidates.end());
        sumRecursion(candidates,target,oneResult,res,0);
        return res;
    }
    
    void sumRecursion(vector<int>& candidates,int target,vector<int>oneResult,vector<vector<int>>& res,int index){
        if(target==0){
            res.push_back(oneResult);
            return;
        }
        if(target>0){
            
            for(int i=index; i<candidates.size() && target>=candidates[i]; i++){
                if(candidates[i]==candidates[i-1]) continue;
                oneResult.push_back(candidates[i]);
                vector<int> local = candidates;
                local.erase(local.begin()+i);//清掉第i位，下一位变成第i位，传递的候选参数local已经清掉了原来的第i位，下一位成了i位
                sumRecursion(local,target-candidates[i],oneResult,res,i);
                oneResult.pop_back();
            }
        }
       
    }
};