题目:
给定一个仅包含数字 2-9 的字符串,返回所有它能表示的字母组合。
给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。
示例:
输入:“23”
输出:[“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”].
说明:
尽管上面的答案是按字典序排列的,但是你可以任意选择答案输出的顺序。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number
解法:
class Solution:
def letterCombinations(self, digits: str) -> List[str]:
if digits=='':
return []
chars = {'2':'abc','3':'def','4':'ghi',\
'5':'jkl','6':'mno','7':'qprs','8':'tuv','9':'wxyz'}
result=[char for char in chars[digits[0]]]
for digit in digits[1:]:
result = [a+b for a in result for b in chars[digit]]
return result
代码片段示例:
解法(递归)
class Solution:
@staticmethod
def letterCombinations(digits):
"""
:type digits: str
:rtype: List[str]
"""
chars = {'2':'abc','3':'def','4':'ghi',\
'5':'jkl','6':'mno','7':'qprs','8':'tuv','9':'wxyz'}
if len(digits)==0:
return []
if len(digits)==1:
return list(chars[digits])
res=[]
res_suffix=Solution.letterCombinations(digits[1:])
for x in chars[digits[0]]:
res.extend([x+y for y in res_suffix])
return res
list.extend()参考:
https://www.runoob.com/python/att-list-extend.html