问题描述:
Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations inC where the candidate numbers sums toT.
The same repeated number may be chosen from C unlimited number of times.
Note:
- All numbers (including target) will be positive integers.
- The solution set must not contain duplicate combinations.
示例:
For example, given candidate set [2, 3, 6, 7]
and target 7
,
A solution set is:
[
[7],
[2, 2, 3]
]
问题来源:Combination Sum (具体地址:https://leetcode.com/problems/combination-sum/#/description