代码随想录算法训练营第二十五天

216.组合总和III

题目链接：组合总和III
自己写了一个剪枝，不知道对不对

class Solution:
    def combinationSum3(self, k: int, n: int) -> List[List[int]]:
        path = []
        result = []
        def backtracking(k, n, index):
            if (sum(path) == n) and (len(path) == k):
                result.append(path[:])
                return 
            for i in range(index,10):
                if (sum(path) > n) or (len(path) > k):
                    continue
                path.append(i)
                backtracking(k, n, (i+1))
                path.pop()
        backtracking(k, n, 1)
        return result

改了一下这样比较好。

class Solution:
    def combinationSum3(self, k: int, n: int) -> List[List[int]]:
        path = []
        result = []
        def backtracking(k, n, index):
            if (sum(path) > n) or (len(path) > k):
                return
            if (sum(path) == n) and (len(path) == k):
                result.append(path[:])
                return 
            for i in range(index,10):
                path.append(i)
                backtracking(k, n, (i+1))
                path.pop()
        backtracking(k, n, 1)
        return result

40.组合总和II

题目链接：组合总和II
尝试写了一下这个，这边重复元素的去重依然不是很擅长，别的倒还行。

class Solution:
    def combinationSum2(self, candidates: List[int], target: int) -> List[List[int]]:
        path = []
        result = []
        def backtracking(candidates, target, index):
            if sum(path) > target:
                return
            if sum(path) == target:
                if path not in result:
                    result.append(path[:])
                    return
            for i in range(index,len(candidates)):
            	#去重
                if i > index and candidates[i] == candidates[i-1]: 
                    continue
                path.append(candidates[i])
                backtracking(candidates, target, (i+1))
                path.pop()
        candidates.sort()
        if sum(candidates)<target:
            return []
        backtracking(candidates, target, 0)
        return result 

17.电话号码的字母组合

题目链接：电话号码的字母组合
做了一个字典来映射，这个题也不用剪枝，还比较容易。

class Solution:
    def letterCombinations(self, digits: str) -> List[str]:
        d = {
            "2":"abc","3":"def","4":"ghi","5":"jkl","6":"mno","7":"pqrs","8":"tuv","9":"wxyz"
        }
        path = []
        result = []
        def backtracking(digits,index):
            if len(path) == len(digits):
                result.append(''.join(path))
                return
            for i in d[digits[index]]:
                path.append(i)
                backtracking(digits,(index+1))
                path.pop()
        if digits == "":
            return []
        backtracking(digits,0)
        return result