#40
Combination Sum II
specialist · 725 · lc medium +31 · verified · 59% accepted · 12,184 likes · top 56%
Description
Given collection candidates (which may contain duplicates) and integer target, find every unique combination of elements that sums to target. Each element may be used at most once. No duplicate combinations are allowed.
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]
]
Code
1
2
3