算法35--Letter 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"].

给定一组数组，利用九键拼音输入法将其转化为可能的字母组合。

首先定义数字与字符的对应关系：

dict={'2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno','7':'pqrs','8':'tuv','9':'wxyz'}

给定数字234  首先考虑第一位2，其对应abc有三种取值情况，此时若已知23的所有组合，则将abc依次与23返回的所有字符一一结合，依次类推，可以递归向下，直至最后只有一个数字，可以直接返回即可。边界条件要考虑输入为空以及输入中有数字1的情况。

class Solution:
    def letterCombinations(self, digits='23'):
        """
        :type digits: str
        :rtype: List[str]
        """
        dict={'2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno','7':'pqrs','8':'tuv','9':'wxyz'}
        return help(digits, dict)
 
def help(s, dict):
    if s=='':
        return []
    if len(s)==1:
        if s=='1':
            return []
        else:
           r=[]
           ss = dict[s]
           for v in ss:
               r.append(v)
           return r
    else:
        tt=[]
        rr = help(s[1:], dict)
        for v in dict[s[0]]:
            for vv in rr:
                tt.append(v+vv)
        return tt

参考一下大神的代码，充分利用python的列表推导式如下：

class Solution:
    def letterCombinations(self, digits='23'):
        """
        :type digits: str
        :rtype: List[str]
        """
        dict={'2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno','7':'pqrs','8':'tuv','9':'wxyz'}
        return help(digits, dict)
 
def help(s, dict):
    if s=='' or (len(s)==1 and s=='1'):
        return []
    if len(s)==1 and s!='1':
        return [v for v in dict[s]]      
    else:
        return [v+vv for v in dict[s[0]] for vv in help(s[1:], dict)]