链接:
题目:
给定一个数组 candidates 和一个目标数 target ,找出 candidates 中所有可以使数字和为 target 的组合。candidates 中的每个数字在每个组合中只能使用一次。
说明:
所有数字(包括目标数)都是正整数。
解集不能包含重复的组合。
示例 1:
输入: candidates = [10,1,2,7,6,1,5], target = 8,
所求解集为:
[
[1, 7],
[1, 2, 5],
[2, 6],
[1, 1, 6]
]
示例 2:
输入: candidates = [2,5,2,1,2], target = 5,
所求解集为:
[
[1,2,2],
[5]
]
我的解法1:在组合总和I的基础上稍作调整。
class Solution(object):
def combinationSum2(self, candidates, target):
res = []
candidates.sort()
print candidates
self.dfs(candidates, target, 0, [], res)
return res
def dfs(self, nums, target, index, path, res):
if target < 0:
return # backtracking
if target == 0:
if path not in res:
res.append(path)
return
for i in xrange(index, len(nums)):
self.dfs(nums, target-nums[i], i+1, path+[nums[i]], res)
别人的解法:
class Solution(object):
def combinationSum2(self, candidates, target):
# Sorting is really helpful, se we can avoid over counting easily
candidates.sort()
result = []
self.combine_sum_2(candidates, 0, [], result, target)
return result
def combine_sum_2(self, nums, start, path, result, target):
if target == 0:
result.append(path)
return
for i in range(start, len(nums)):
# 判断条件放到循环里,不用多调用一次,提速
if nums[i] > target:
break
return
if i>start and nums[i] == nums[i-1]:
continue
self.combine_sum_2(nums, i+1, path+[nums[i]], result, target-nums[i])