leetcode39. Combination Sum

题目描述（难度：Medium）：

Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
The same repeated number may be chosen from C unlimited number of times.
Note:
All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
For example, given candidate set [2, 3, 6, 7] and target 7, 
A solution set is: 
[
  [7],
  [2, 2, 3]
]

another example,

Input:
[8,7,4,3]
11
Expected Output:
[[3,4,4],[3,8],[4,7]]

Tags： Array， Backtracking
Similar Problems： (M) Letter Combinations of a Phone Number， (M) Combination Sum II， (M) Combinations， (M) Combination Sum III， (M) Factor Combinations， (M) Combination Sum IV

分析：所有的数字包括target都是正数，结果集不能有重复的组合；每个数字可以被选择无数次！即每一个单独的组合里可以出现重复的数字

代码实现：

class Solution(object):
    def combinationSum(self, candidates, target):
        """
        :type candidates: List[int]
        :type target: int
        :rtype: List[List[int]]
        """
        result = []
        n = len(candidates)
        candidates.sort()#有助于剪枝
        
        def dfs(start, tmpRes, target):
            if target==0:
                result.append(tmpRes[:])
                return
            for i in range(start, n):
                if target-candidates[i]<0:#尽早剪枝
                    break
                tmpRes.append(candidates[i])
                dfs(i, tmpRes, target-candidates[i])
                tmpRes.pop()#还原递归现场
                    
        dfs(0, [], target)
        return result