【LeetCode】17. 电话号码的字母组合

题目描述（中等难度）

解题思路

回溯算法：选择与撤回

python 代码

class Solution(object):
  def letterCombinations(self, digits):
    """
    :type digits: str
    :rtype: List[str]
    """
    if len(digits) == 0:
      return []

    d = {1: "", 2: "abc", 3: "def", 4: "ghi", 5: "jkl", 6: "mno", 7: "pqrs", 8: "tuv", 9: "wxyz"}

    def dfs(digits, index, path, res, d):
      if index == len(digits):
        res.append("".join(path))
        return

      digit = int(digits[index])
      for c in d.get(digit, []):
        path.append(c)
        dfs(digits, index + 1, path, res, d)
        path.pop()

    res = []
    dfs(digits, 0, [], res, d)
    return res

if __name__ == '__main__':
    s = Solution()
    # res = s.letterCombinations("23")
    res = s.letterCombinations("5678")
    print(res)