| English | 简体中文 |
Given a set of candidate numbers (
candidates) (without duplicates) and a target number (
target), find all unique combinations in
candidates where the candidate numbers sums to
The same repeated number may be chosen from
candidates unlimited number of times.
- All numbers (including
target) will be positive integers.
- The solution set must not contain duplicate combinations.
Input: candidates =
7, A solution set is: [ , [2,2,3] ]
Input: candidates = [2,3,5]
,target = 8, A solution set is: [ [2,2,2,2], [2,3,3], [3,5] ]