题目:给定一个仅包含数字 2-9 的字符串,返回所有它能表示的字母组合。
给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。
示例:
输入:"23"
输出:["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
说明:
尽管上面的答案是按字典序排列的,但是你可以任意选择答案输出的顺序
class Solution:
def letterCombinations(self, digits: str) -> List[str]:
#递归法求解本问题
# numMap = {'2':'abc', '3':'def', '4':'ghi', '5':'jkl', '6':'mno', '7':'pqrs', '8':'tuv', '9':'wxyz'}
# strLen = len(digits)
# if strLen == 0 :
# return []
# if strLen == 1 :
# digitLen = len(numMap[digits])
# sumMap = []
# for i in range(digitLen):sumMap.append(numMap[digits][i])
# return sumMap
# else:
# strAdd = Solution.letterCombinations(self,digits[1:])
# sumAddList = []
# for i in range(len(numMap[digits[0]])):
# sumAddList += list(map(lambda x : numMap[digits[0]][i] + x, strAdd))
# return sumAddList
KEY = {'2': ['a', 'b', 'c'],
'3': ['d', 'e', 'f'],
'4': ['g', 'h', 'i'],
'5': ['j', 'k', 'l'],
'6': ['m', 'n', 'o'],
'7': ['p', 'q', 'r', 's'],
'8': ['t', 'u', 'v'],
'9': ['w', 'x', 'y', 'z']}
if digits == '':
return []
ans = ['']
for num in digits:
ans = [pre+suf for pre in ans for suf in KEY[num]]
return ans
# mapping = {'2':'abc', '3':'def',
# '4':'ghi', '5':'jkl',
# '6':'mno', '7':'pqrs',
# '8':'tuv', '9':'wxyz'}
# prevpossibilities = []
# for digit in digits:
# possibilities = []
# if len(prevpossibilities) == 0:
# possibilities = list(mapping[digit])
# else:
# for letter in mapping[digit]:
# for prefix in prevpossibilities:
# possibilities += [prefix+letter]
# prevpossibilities = possibilities
# return prevpossibilities