题目:给定一个包含数字2-9的字符串,返回它所能表示的字母组合
法:先建立一个数字到字符的字典,再用列表写
def letterCombinations(self, digits):
"""
:type digits: str
:rtype: List[str]
"""
if digits=='':return []
dict1={'2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno','7':'pqrs','8':'tuv','9':'wxyz'}
res=[x for x in dict1[digits[0]]]
for m in digits[1:]:
res=[x+y for x in res for y in dict1[m] ]
return res