목록Combination Sum II (1)

Scribbling

LeetCode: 40. Combination Sum II

class Solution: def combinationSum2(self, candidates: List[int], target: int) -> List[List[int]]: candidates.sort() self.ret = [] self.dfs(candidates, target, []) return self.ret def dfs(self, candidates, target, path): if target < 0: return if target == 0: self.ret.append(path) return prev = None for i, candidate in enumerate(candidates): if candidate != prev: prev = candidate self.dfs(candidat..
Computer Science/Coding Test 2021. 9. 7. 21:19
이전 Prev 1 Next 다음