[leetcode]40.Combination Sum II(Medium)

Description:

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

 

class Solution {
public:
    void cSum(vector<int>& candidates,vector<vector<int>>& solutions,vector<int>& solution,int target,int startIndex){
        if (target==0){
            solutions.push_back(solution);
            return;
        }
        else if (target>0){
            for(int i=startIndex;i<candidates.size();i++){
                int x=candidates[i];
                if((target-x)>=0){
                    solution.push_back(x);
                    cSum(candidates,solutions,solution,target-x,i+1);
                    solution.pop_back();
                }
            }
        }
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<vector<int>> solutions;
        vector<int> solution;
        sort(candidates.begin(),candidates.end());
        cSum(candidates,solutions,solution,target,0);
        sort(solutions.begin(),solutions.end());
        solutions.erase(unique(solutions.begin(), solutions.end()), solutions.end());
        return solutions;
    }
};