g0001_0100.s0040_combination_sum_ii

Class Solution

java.lang.Object

g0001_0100.s0040_combination_sum_ii.Solution

public class Solution
extends Object

40 - Combination Sum II.

Medium

Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target.

Each number in candidates may only be used once in the combination.

Note: The solution set must not contain duplicate combinations.

Example 1:

Input: candidates = [10,1,2,7,6,1,5], target = 8

Output:

[
[1,1,6],
[1,2,5],
[1,7],
[2,6]
] 

Example 2:

Input: candidates = [2,5,2,1,2], target = 5

Output:

[
[1,2,2],
[5]
] 

Constraints:

• 1 <= candidates.length <= 100
• 1 <= candidates[i] <= 50
• 1 <= target <= 30

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
List<List<Integer>>	combinationSum2(int[] candidates, int target)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Solution

public Solution()

Method Detail

combinationSum2

public List<List<Integer>> combinationSum2(int[] candidates,
                                           int target)