python-leetcode面试题解之第17题电话号码的字母组合.zip

# class Solution(object): # def letterCombinations(self, digits): # """ # :type digits: str # :rtype: List[str] # """ dmap = {'2': 'abc', '3': 'def', '4': 'ghi', '5': 'jkl', '6': 'mno', '7': 'pqrs', '8': 'tuv', '9': 'wxyz', '0': ' ', None: None} class Solution(object): def letterCombinations(self, digits): # DFS result = [] ls = len(digits) if ls == 0: return result current = digits[0] posfix = self.letterCombinations(digits[1:]) for t in dmap[current]: if len(posfix) > 0: for p in posfix: temp = t + p result.append(temp) else: result.append(t) return result