给定一个仅包含数字 2-9
的字符串,返回所有它能表示的字母组合。
给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。
示例:
输入:"23" 输出:["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
说明:
本题用到字典,很简单,很无脑,我写了个非递归版的
class Solution:
def letterCombinations(self, digits):
"""
:type digits: str
:rtype: List[str]
"""
shuju ={"2":"abc","3":"def","4":"ghi","5":"jkl","6":"mno","7":"pqrs","8":"tuv","9":"wxyz"}
digits = list(digits)
res =[]
while digits:
print(digits)
print(res)
a = digits.pop(0)
if res == [] :#如果res没有值直接加进去
for i in shuju[a]:
res.append(i)
else :
temp2 = []
for i in shuju[a]:
temp = res
def fx(x):
return x+i
temp2 += list(map(fx,temp))
res = temp2
return res
提交后看到一个大神些的,相形见绌,思想和我一样,代码如下(学习)
class Solution:
def letterCombinations(self, digits):
"""
:type digits: str
:rtype: List[str]
"""
if not digits:
return []
digit2chars = {
'2': 'abc',
'3': 'def',
'4': 'ghi',
'5': 'jkl',
'6': 'mno',
'7': 'pqrs',
'8': 'tuv',
'9': 'wxyz'
}
res = [ i for i in digit2chars[digits[0]] ]
for i in digits[1:]:
res = [ m+n for m in res for n in digit2chars[i] ]
print (res)
return res