<p>Given a collection of candidate numbers (<code>candidates</code>) and a target number (<code>target</code>), find all unique combinations in <code>candidates</code>&nbsp;where the candidate numbers sum to <code>target</code>.</p>

<p>Each number in <code>candidates</code>&nbsp;may only be used <strong>once</strong> in the combination.</p>

<p><strong>Note:</strong>&nbsp;The solution set must not contain duplicate combinations.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> candidates = [10,1,2,7,6,1,5], target = 8
<strong>Output:</strong> 
[
[1,1,6],
[1,2,5],
[1,7],
[2,6]
]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> candidates = [2,5,2,1,2], target = 5
<strong>Output:</strong> 
[
[1,2,2],
[5]
]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;=&nbsp;candidates.length &lt;= 100</code></li>
	<li><code>1 &lt;=&nbsp;candidates[i] &lt;= 50</code></li>
	<li><code>1 &lt;= target &lt;= 30</code></li>
</ul>

class Solution {
    vector<vector<int>> ans;
    vector<int> curr;
    int t;
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<int> freq(51,0);
        t = target;
        int maxm = candidates[0];
        for(int i=0;i<candidates.size();i++) {
            freq[candidates[i]]++;
            maxm = max(maxm, candidates[i]);
        }
        int sum = 0; 
        rec(freq,sum,1,maxm);
        return ans;
    }

    void rec(vector<int>& freq, int &sum, int i, int n) {
        if(i>n || sum>t) {
            if(sum==t) {
                ans.push_back(curr);
            }
            return;
        }
        rec(freq,sum,i+1,n);
        if(freq[i]>0){
            sum += i;
            freq[i]--;
            curr.push_back(i);
            rec(freq,sum,i,n);
            curr.pop_back();
            freq[i]++;
            sum -= i;
        }
    }

};
15856