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] 

Difficulty: Medium

和上一题一样，就是考虑下重复情况。

void backtracking(vector<vector<int> >& ans,vector<int>& temp,vector<int>& candidates, int target,int len)
{


    vector<int> temp1;
    int i = len-1;
    if(target<0||len<=0)
       return;
    int a[candidates[len-1]];
    memset(a,0,sizeof(a));
    while(i>=0)
    {
        if(a[candidates[i]]==1)
        {
            i--;
            continue;
        }
        else{
        if(candidates[i]>target){
            i--;
            continue;
        }
        else if(candidates[i]==target)
        {
            temp1 = temp;
            temp1.push_back(candidates[i]);
            sort(temp1.begin(),temp1.end());
            ans.push_back(temp1);
            a[candidates[i]]=1;
        }
        else
        {
            temp1 = temp;
            temp1.push_back(candidates[i]);
            backtracking(ans,temp1,candidates,target - candidates[i],i);
            a[candidates[i]]=1;
        }
        }
        i--;
    }
}

vector<vector<int> > combinationSum2(vector<int>& candidates, int target) {
    vector<vector<int> > ans;
    vector<int> t;
    int len = candidates.size();
    sort(candidates.begin(),candidates.end());
    backtracking(ans,t,candidates,target,len);
    return ans;
    }