<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:
		std::vector<std::vector<int>> combinationSum2(std::vector<int> &candidates, int target, int i = -1,
			std::vector<std::vector<int>> *combinations = nullptr, std::vector<int> *combination = nullptr)
		{
			if (i == -1)
			{
				std::sort(candidates.begin(), candidates.end());
				combinations = new std::vector<std::vector<int>>();
				combination = new std::vector<int>();
				this->combinationSum2(candidates, target, 0, combinations, combination);
			}
			else
			{
				if (target == 0)
					combinations->push_back(*combination);
				else
					for (int j = i; j < candidates.size() && candidates[j] <= target; j++)
						if (i == j || candidates[j] != candidates[j-1])
						{
							combination->push_back(candidates[j]);
							this->combinationSum2(candidates, target-candidates[j], j+1, combinations, combination);
							combination->pop_back();
						}
			}
			return *combinations;
		}
};
21260