Table of Content
题目如下：
这道题思路如下，想象手机的用户逐一输入数字，我们用一个列表res来记录之前输入结果，用另一个数组来对当前的输入结果进行更新。
参考代码如下：
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 |
class Solution: def letterCombinations(self, digits): """ :type digits: str :rtype: List[str] """ if not digits: return [] type_dic = { "2": "abc", "3": "def", "4": "ghi", "5": "jkl", "6": "mno", "7": "pqrs", "8": "tuv", "9": "wxyz" } res = [""] for d in digits: temp = [] if d in type_dic.keys(): for c in type_dic[d]: for r in res: temp.append(r + c) res = temp return res |
