combination-sum-ii

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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>.

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

Note:&nbsp;The solution set must not contain duplicate combinations.

&nbsp;
Example 1:

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

Example 2:

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

&nbsp;
Constraints:

<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>

combinationSum2

Combination Sum II

Combination Sum

combination-sum

组合总和

Array

Backtracking

给定一个候选人编号的集合&nbsp;<code>candidates</code>&nbsp;和一个目标数&nbsp;<code>target</code>&nbsp;，找出&nbsp;<code>candidates</code>&nbsp;中所有可以使数字和为&nbsp;<code>target</code>&nbsp;的组合。

<code>candidates</code>&nbsp;中的每个数字在每个组合中只能使用&nbsp;一次&nbsp;。

注意：解集不能包含重复的组合。&nbsp;

&nbsp;

示例&nbsp;1:

<pre>
输入: candidates =&nbsp;<code>[10,1,2,7,6,1,5]</code>, target =&nbsp;<code>8</code>,
输出:
[
[1,1,6],
[1,2,5],
[1,7],
[2,6]
]</pre>

示例&nbsp;2:

<pre>
输入: candidates =&nbsp;[2,5,2,1,2], target =&nbsp;5,
输出:
[
[1,2,2],
[5]
]</pre>

&nbsp;

提示:

<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>