LeetCode-17. Letter Combinations of a Phone Number

0.原题

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.

 

1.代码

class Solution:
    def letterCombinations(self, digits):
        """
        :type digits: str
        :rtype: List[str]
        """
        if digits:
            nums = int(digits)
            result = ['']
            result = self.fun(nums, result)
            return result
        else:
            return []

    def fun(self,nums,result):
        if nums == 0:
            return result
        else:
            new_result = []
            letters_list = ['abc', 'def', 'ghi', 'jkl', 'mno', 'pqrs', 'tuv', 'wxyz']
            num = nums % 10
            nums = nums // 10
            letters = letters_list[num - 2]
            for letter in letters:
                for r in result:
                    new_result.append(letter + r )
            print(new_result)
            result = self.fun(nums,new_result)
            return result