【leetcode题解】【M】【67】Letter Combinations of a Phone Number

Given a digit string, 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.

Input:Digit string "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.

Subscribe to see which companies asked this question

class Solution(object):
    def bt(self,dic,s,temp,start,l,res):
        if l == len(s):
            res.append(temp)
        for i in range(start,len(s)):
            for j in dic[s[i]]:
                self.bt(dic,s,temp+j,i+1,l+1,res)

    def letterCombinations(self, digits):
        if len(digits) == 0:
            return []
        dic = {'2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno','7':'pqrs','8':'tuv','9':'wxyz'}
        res = []
        #print len(dic['2'])
        self.bt(dic,digits,'',0,0,res)
        return res