leetcode之回溯算法

22.括号的生成
2021.2.22

class Solution:
    def generateParenthesis(self, n: int) -> List[str]:
        res = []
        def DFS(L, R, cur_str):
            if L==n and R==n:
                res.append(cur_str)
                return
            if L<R:
                return
            if L<n:
                DFS(L+1, R, cur_str+'(')              
            if R<n:
                DFS(L, R+1, cur_str+')')

        DFS(0,0,"")
        return res
            

39.组合总和
2021.3.2

class Solution:
    def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
        ans = []
        def DFS(cur,cur_list,Add):
            if cur+Add>target:
                return
            if cur+Add==target:
                cur_list.append(Add)
                # 因为没有剪枝，所以会生成相同的组合，当该组合已经存在，则不再加入到结果
                cur_list = sorted(cur_list)
                for an in ans:
                    if an == cur_list:
                        return
                ans.append(cur_list)
                return
            for candidate in candidates:
                DFS(cur+Add, cur_list+[Add], candidate)
        for candidate in candidates:
            DFS(0, [], candidate)

        return ans

剪枝后

class Solution:
    def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
        ans = []
        l = len(candidates)
        def DFS(cur,cur_list, begin, Add,l):
            if cur+Add>target:
                return
            if cur+Add==target:
                cur_list.append(Add)
                ans.append(cur_list)
                return
            for i in range(begin, l):
                DFS(cur+Add, cur_list+[Add], i, candidates[i],l)

        for i in range(l):
            DFS(0, [], i,candidates[i],l)

        return ans