leetcode-17. 电话号码的字母组合

题目描述

给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。答案可以按 任意顺序 返回。

给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。

示例 1：

输入：digits = "23"
输出：["ad","ae","af","bd","be","bf","cd","ce","cf"]

示例 2：

输入：digits = ""
输出：[]

示例 3：

输入：digits = "2"
输出：["a","b","c"]

思路

回溯

1）先用一个字典保存映射关系

2）回溯：有一个终止条件：一般都是长度等于对应的一个值

3）回溯：append() 一个

4）回溯：递归

5）回溯：pop() 一个

class Solution(object):
    def __init__(self):
        self.dict = {
            '2':["a","b","c"], '3':["d","e","f"], '4':["g","h","i"], '5':["j","k","l"],
            '6':["m","n","o"], '7':["p","q","r","s"], '8':["t","u","v"], '9':["w","x","y","z"]
        }
        self.res = []
        self.str = ""
    
    def backtrack(self, digits, index):
        if index == len(digits):
            self.res.append(self.str)
            return 
        letter = self.dict[digits[index]]
        for i in letter:
            self.str += i 
            self.backtrack(digits,index+1)
            self.str = self.str[:-1]

    def letterCombinations(self, digits):
        """
        :type digits: str
        :rtype: List[str]
        """
        if not digits:
            return []
        index = 0
        self.backtrack(digits,index)  
        return self.res