[leetcode]39. Combination Sum(Medium)

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

 

class Solution:
                
    def cSum(self,candidates,solutions,solution,target,startIndex):
        
        if target == 0:
            solutions.append(solution)
            return 
        elif target > 0:
            for i in range(startIndex,len(candidates)):
                x=candidates[i]
                if target - x >= 0:
                    # solution.append(x) 
                    self.cSum(candidates, solutions, solution + [x], target-x, i)
                    # solution.pop()
                else:
                    break


    def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
        solutions=[]
        solution=[]
        candidates.sort()
        self.cSum(candidates,solutions,solution,target,0)
        return solutions