python leetcode 17. 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.

给定数字，返回可能的字母输出（电话座机，九宫格输入）

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

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(object):
    def letterCombinations(self, digits):
        """
        :type digits: str
        :rtype: List[str]
        """
        if len(digits) == 0:
            return []
        digit_letter = {0: '0',
                        1: '1',
                        2: 'abc',
                        3: 'def',
                        4: 'ghi',
                        5: 'jkl',
                        6: 'mno',
                        7: 'pqrs',
                        8: 'tuv', 9: 'wxyz'}
        result = ['']
        for digit in digits:
            tmp = []
            for letter in digit_letter[int(digit)]:
                for string in result:
                    tmp.append(string + letter)
            result = tmp
        return result