Class Solution
java.lang.Object
g0001_0100.s0040_combination_sum_ii.Solution
40 - Combination Sum II.<p>Medium</p>
<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> where the candidate numbers sum to <code>target</code>.</p>
<p>Each number in <code>candidates</code> may only be used <strong>once</strong> in the combination.</p>
<p><strong>Note:</strong> The solution set must not contain duplicate combinations.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> candidates = [10,1,2,7,6,1,5], target = 8</p>
<p><strong>Output:</strong></p>
<pre><code> [
[1,1,6],
[1,2,5],
[1,7],
[2,6]
]
</code></pre>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> candidates = [2,5,2,1,2], target = 5</p>
<p><strong>Output:</strong></p>
<pre><code> [
[1,2,2],
[5]
]
</code></pre>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= candidates.length <= 100</code></li>
<li><code>1 <= candidates[i] <= 50</code></li>
<li><code>1 <= target <= 30</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
combinationSum2
-