Leetcode-39. Combination Sum 两数之和

题目

给定一个无重复元素的数组 candidates 和一个目标数 target ，找出 candidates 中所有可以使数字和为 target 的组合。

candidates 中的数字可以无限制重复被选取。

链接：https://leetcode.com/problems/combination-sum/

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 target.

The same repeated number may be chosen from candidates unlimited number of times.
Example:

Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
[7],
[2,2,3]
]

思路及代码

• Recursive

class Solution:
    def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
        ans = []
        cur = []
        candidates = sorted(candidates)
        
        def dfs(candidates, target, start, cur, ans):
            if target == 0:
                l = cur.copy()
                ans.append(l)
                return
            for i in range(start, len(candidates)):
                if candidates[i] > target:
                    break
                cur.append(candidates[i])
                dfs(candidates, target - candidates[i], i, cur, ans)
                cur.pop()
                
        dfs(candidates, target, 0, cur, ans)              
        return ans

注意事项

划重点！！！
这里必须转成值传递，否则ans.append(cur)会出现mutation的问题，即加cur的地址，当cur改变之后，ans也会变化。

l = cur.copy()