mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
40 lines
1.0 KiB
HTML
40 lines
1.0 KiB
HTML
<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> </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> </p>
|
|
<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>
|