Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
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] ]在任意数据可以重复使用的情况下,寻找所有与目标数字的和相等的子集,通用点的办法,回溯算法,说到底也是一个递归的使用
class Solution(object):
def combinationSum(self, candidates, target):
"""
:type candidates: List[int]
:type target: int
:rtype: List[List[int]]
"""
Solution.re = []
self.backtracking(candidates,target,0,[])
return Solution.re
def backtracking(self, candidates, target, start, val):
if target == 0:
Solution.re.append(val)
else:
for i in range(start,len(candidates)):
if target < 0:
break
self.backtracking(candidates,target-candidates[i],i,val+[candidates[i]])