题目描述
方法:
哈希表保存数字字母对应关系 + 递归记录字母组合
class Solution:
def letterCombinations(self, digits: str) -> List[str]:
if not digits:
return []
table = {"1":"",
"2":"abc",
"3":"def",
"4":"ghi",
"5":"jkl",
"6":"mno",
"7":"pqrs",
"8":"tuv",
"9":"wxyz"}
result = []
def recur(s, res):
if s == "":
result.append(res)
return
for d in table[s[0]]:
recur(s[1:], res+d)
recur(digits,"")
return result