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

1. 题目：

给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。
给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。

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

2. 代码：

递归回溯

class Solution:
    def letterCombinations(self, digits: str) -> List[str]:
        lens = len(digits)
        if lens == 0:
            return []

        def DFS(digits,l_digits,depth,r,path):
            if depth == l_digits:
                res.append(path[:]) 
                return
            lists = dic[digits[depth]]
            lens = len(lists)
            for i in range(lens):
                path = path + lists[i]
                DFS(digits,l_digits,depth+1,r,path)
                path = path[:-1]

        dic = {'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']}
        res =[]
        path = ''
        DFS(digits,lens,0,res,path)
        return res

列表推导式：

class Solution:
    def letterCombinations(self, digits: str) -> list:
        KEY = {'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']}
        if digits == '':
            return []
        ans = ['']
        for num in digits:
            ans = [pre+suf for pre in ans for suf in KEY[num]]
        return ans