回答此问题可获得 20 贡献值,回答如果被采纳可获得 50 分。
<p>我实现了一个组合求和算法来解决以下问题:</p>
<pre><code># Given an array: [10,1,2,7,6,1,5]
# and a target: 8
# Find the solution set that adds up to the target
# in this case:
# [1, 7]
# [1, 2, 5]
# [2, 6]
# [1, 1, 6]
def cominbationSum(arr, target):
arr =sorted(arr)
res = []
path = []
dfs_com(arr, 0, target, path, res)
return res
def dfs_com(arr, curr, target, path, res):
if target == 0:
res.append(path)
return
if target < 0:
return
for i in range(curr, len(arr)):
if i > curr and arr[i] == arr[i-1]: # skip duplicates
continue
path.append(arr[i])
dfs_com(arr, i+1, target - arr[i], path, res)
path.pop(len(path)-1)
print cominbationSum([10,1,2,7,6,1,5], 8)
</code></pre>
<p>我的算法生成正确的组合,但在返回<code>res</code>时遇到问题。它将<code>res</code>返回为<code>[[],[],[],[]]</code>,而不是<code>[[1, 1, 6],[1, 2, 5],[1, 7],[2, 6]]</code>。知道路径为什么不能正确地附加到res上吗?在</p>