목록39. Combination Sum (1)

Scribbling

39. Combination Sum

class Solution: def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]: ret = [] arr = [0] self.helper(ret, arr, candidates, target) return ret def helper(self, ret, arr, candidates, target): _sum = sum(arr) if _sum > target: return if _sum == target: ret.append(arr[1:]) return for candidate in candidates: last_input = arr[-1] if candidate >= last_input: next_arr = arr.c..
Computer Science/Coding Test 2021. 9. 4. 19:31
이전 Prev 1 Next 다음