代码随想录算法训练营第二十五天| 第七章 回溯算法：216.组合总和III，17.电话号码的字母组合（python）

216.组合总和III

讲解视频链接

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

    def combinationSum3(self, k: int, n: int) -> List[List[int]]:
        self.backtracking(k, n, 1)
        return self.res

    def backtracking(self, k, n, start_index):
        if self.sum > n:
            return
        if len(self.path) == k:
            if n == self.sum:
                self.res.append(self.path[:])
            return
        for i in range(start_index, 10):
            self.path.append(i)
            self.sum += i
            self.backtracking(k, n, i+1)
            self.sum -= i
            self.path.pop()

17.电话号码的字母组合

视频讲解链接

class Solution:
    def __init__(self):
        self.s = str()
        self.res = []
        self.letterMap = {
            '2':"abc",
            '3':"def",
            '4':"ghi",
            '5':"jkl",
            '6':"mno",
            '7':"pqrs",
            '8':"tuv",
            '9':"wxyz"
        }

    def letterCombinations(self, digits: str) -> List[str]:
        if not digits:
            return []
        self.backtracking(digits,0)
        return self.res
        
    
    def backtracking(self, digits, index):
        if index == len(digits):
            self.res.append(self.s) 
            return
        letters = self.letterMap[digits[index]]
        for item in letters:
            self.s += item
            self.backtracking(digits, index +1)
            self.s = self.s[:-1]