Leetcode 40. Combination Sum II

最新推荐文章于 2021-12-25 22:24:44 发布

附近得人

最新推荐文章于 2021-12-25 22:24:44 发布

阅读量124

点赞数

分类专栏： Leetcode problems 1-100 文章标签： Leetcode

本文链接：https://blog.csdn.net/u014687517/article/details/94177213

版权

Leetcode problems 1-100 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

Leetcode 40. Combination Sum II
Python 解题思路

class Solution:
    def __init__(self):
        self.res = []
        self.path = []
        self.candidates = []

    def dfs(self, target, ind):
        if target < 0:
            return
        if target == 0:
            self.res.append(self.path.copy())
            return
        for i in range(ind, len(self.candidates)):
            if i > ind and self.candidates[i] == self.candidates[i-1]:
                continue
            self.path.append(self.candidates[i])
            self.dfs(target - self.candidates[i], i+1)
            self.path.remove(self.candidates[i])

    def combinationSum2(self, candidates, target):
        self.candidates = sorted(candidates)
        self.dfs(target, 0)
        return self.res