代码随想录一刷：补Day25

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

文章目录

• 前言
• 一、组合总数
• 二、电话号码字母组合
• 总结

---

前言

每日刷题，从己做起。

 

一、组合总数

class Solution:
    def combinationSum3(self, k: int, n: int) -> List[List[int]]:
        result = []
        self.backtracking(n, k, 0, 1, [], result)
        return result
    def backtracking(self, targetSum, k, currentSum, startIndex, path, result):
        if currentSum > targetSum:#剪枝操作
            return  
        if len(path) == k:
            if currentSum == targetSum:
                result.append(path[:])
            return
        for i in range(startIndex, 9 - (k - len(path)) + 2):#剪枝
        
            currentSum += i
            path.append(i)
            self.backtracking(targetSum, k, currentSum, i + 1, path, result)
            currentSum -= i
            path.pop()

二、电话号码字母组合

class Solution:
    def __init__(self):
        self.letterMap = [
            "",
            "",
            "abc",
            "def",

            "ghi",
            "jkl",
            "mno",
            "pqrs",
            "tuv",
            "wxyz",
            ]
        self.result = []
        self.s = ""
    def backtracking(self, digits, index):
        if index == len(digits):
            self.result.append(self.s)
        return
        
        digit = int(digits[index])
        letters = self.letterMap[digit]
        for i in range(len(letters)):
            self.s += i
            self.backtracking(digits, index + 1)
            self.s = self.s[:-1]
   def letterCombinations(self, digits: str):
        if len(digits) == 0:
            return self.result
        self.backtracking(digits, 0)
        return self.result
    

---

总结