# Leetcode : 17 Letter Combinations of a Phone Number

17Letter Combinations of a Phone Number

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.

A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.

Example:

Input: "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].


Note:

Although the above answer is in lexicographical order, your answer could be in any order you want.

class Solution:

def letterCombinations(self, digits):
"""
:type digits: str
:rtype: List[str]
"""
zmb={'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']}

def get_ans(l,i,digits,ans,tem):
if(i<l):
for k in zmb[digits[i]]:
get_ans(l,i+1,digits,ans,tem+k)

elif(l==i):
if (tem!=""):
ans.append(tem)
return

ans=[]
l=len(digits)
i=0
tem=""
get_ans(l,i,digits,ans,tem)
return ans


• 写评论