首页 > TAG信息列表 > NO.40

NO.39 组合总数Ⅰ NO.40 组合总数Ⅱ

class Solution: def combinationSum2(self, candidates: List[int], target: int) -> List[List[int]]: res = [] path = [] n = len(candidates) candidates.sort() def backtracking(startIndex, target): if