Advertisement
jinhuang1102

39. Combination Sum

Nov 13th, 2018
148
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.52 KB | None | 0 0
  1. def backtrackCombSum(self, nums, target, idx, temp, res):
  2.     if target < 0:
  3.         return
  4.     if target == 0:
  5.         res.append(temp)
  6.         return
  7.     for i in range(idx, len(nums)):
  8.         self.backtrackCombSum(nums, target - nums[i], i, temp + [nums[i]], res)
  9.  
  10.     return
  11.  
  12.  
  13. def combinationSum(self, candidates, target):
  14.     """
  15.    :type candidates: List[int]
  16.    :type target: int
  17.    :rtype: List[List[int]]
  18.    """
  19.     res = []
  20.     self.backtrackCombSum(candidates, target, 0, [], res)
  21.     return res
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement