LeetCode-39 Combination Sum

Description

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.

Note:
All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.

Example

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

Example 2:
Input: candidates = [2,3,5], target = 8,
A solution set is:
[
[2,2,2,2],
[2,3,3],
[3,5]
]

Submissions

我的解题思路是采用递归的思想，回溯和减枝。首先将给定的无重复元素的数组candidates进行排序，然后定义com函数，设置start是避免结果重复，判断当目标值等于0时则直接添加ans列表，当比ans最后一个还小，因为是递增列表，所以直接返回空，否则遍历给定数组，目标值依次减去值，ans依次添加值，每次递归结束都会将ans添加到result中并返回。

实现代码如下：

class Solution:
    def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]: 
        candidates.sort()
        def com(lists,num,start,ans,result):
            if num==0:
                result.append(ans)
            if ans and num<ans[-1]:
                return
            for i in range(start,len(lists)):
                com(lists,num-lists[i],i,ans+[lists[i]],result)
            return result        
        res=com(candidates,target,0,[],[])
        return res