<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 {
public:
    vector<vector<int>> tempAns;
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) 
    {
        sort(candidates.begin(),candidates.end());
    vector<int> c;
    func(candidates,candidates.size(),target,c,0,0);
    vector<vector<int>> ans=tempAns;
    tempAns.clear();
    return ans;
    }
    void func(vector<int> arr,int n,int target,vector<int> cur,int index,int sum)
{
    if(sum==target)
        tempAns.push_back(cur);
    else
        for(int i=index;i<n;++i)
        {
            if(target==sum+arr[i])
            {
                cur.push_back(arr[i]);
                tempAns.push_back(cur);
                return;
            }
            if((target<arr[i]+sum)||(i!=index&&arr[i]==arr[i-1]))
                continue;
            cur.push_back(arr[i]);
            func(arr,n,target,cur,i+1,sum+arr[i]);
            cur.pop_back();
        }
    return;
}
};
17166