LeetCode Combination Sum

题目

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.

Note:

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

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]
]

解答：

# 因为组元素的个数没有限制，所以不能穷举了。但是依然可以从小到大的方式，注意所有数字都是正的，所以一旦超过target就可以停止尝试啦
class Solution:
    def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
        res = []
        temp = []
        candidates.sort()
        self.serch_num(candidates, target, temp, res, 0)
        return res
    
    def serch_num(self, candidates, target, temp, res, lastpos):
        if target < 0 or candidates[0] == 0:
            return 
        if target == 0:
            res.append(temp)
            return res
        
        for i in range(lastpos, len(candidates)):
            if target < candidates[i]:
                break
            self.serch_num(candidates, target-candidates[i], temp+[candidates[i]], res, i)

总结：

1. list之间了一通过+合并

2. 递归调用，需要从list中找出递增和递减的等式

if target == 0: 

    res.append(temp)，

serch_num(candidates, target-candidates[i], temp+[candidates[i]], res, i)

if target < candidates[i]:
                break