LeetCode_Everyday：017 Letter Combinations of a Phone Number-CSDN博客

本文链接：https://blog.csdn.net/xiaoxuebajie/article/details/106957318

LeetCode_Everyday：017 Letter Combinations of a Phone Number

LeetCode Everyday：坚持价值投资，做时间的朋友！！！

题目:

给定一个仅包含数字2-9的字符串，返回所有它能表示的字母组合。
给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。

示例：

示例 1:

输入："23"
输出：["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

说明：

尽管上面的答案是按字典序排列的，但是你可以任意选择答案输出的顺序。

代码

方法一： python中嵌套for循环

执行用时：44 ms, 在所有 Python3 提交中击败了40.93%的用户
内存消耗：13.8 MB, 在所有 Python3 提交中击败了5.41%的用户


class Solution:
    def letterCombinations(self, digits):
        """
        :type digits: str
        :rtype: List[str]
        """
        conversion={'2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno','7':'pqrs','8':'tuv','9':'wxyz'}
        if len(digits)==0:
            return [] 
        product=['']
        for k in digits:
            product=[i+j for i in product for j in conversion[k]]
        return product

"""
For Example:    input:   digits = "23"
               output:   ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]
"""
digits = "23"
                
solution = Solution()
result = solution.letterCombinations(digits)
print('输出为:', result)

方法二： 回溯

执行用时：40 ms, 在所有 Python3 提交中击败了65.51%的用户
内存消耗：13.5 MB, 在所有 Python3 提交中击败了5.41%的用户


class Solution:
    def letterCombinations(self, digits):
        """
        :type digits: str
        :rtype: List[str]
        """
        if not digits: return []

        phone = {'2':['a','b','c'],
                 '3':['d','e','f'],
                 '4':['g','h','i'],
                 '5':['j','k','l'],
                 '6':['m','n','o'],
                 '7':['p','q','r','s'],
                 '8':['t','u','v'],
                 '9':['w','x','y','z']}
                
        def backtrack(conbination,nextdigit):
            if len(nextdigit) == 0:
                res.append(conbination)
            else:
                for letter in phone[nextdigit[0]]:
                    backtrack(conbination + letter,nextdigit[1:])

        res = []
        backtrack('',digits)
        return res
    
"""
For Example:    input:   digits = "23"
               output:   ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]
"""
digits = "23"
                
solution = Solution()
result = solution.letterCombinations(digits)
print('输出为:', result)

方法三： 队列

执行用时：40 ms, 在所有 Python3 提交中击败了65.51%的用户
内存消耗：13.8 MB, 在所有 Python3 提交中击败了5.41%的用户


class Solution:
    def letterCombinations(self, digits):
        """
        :type digits: str
        :rtype: List[str]
        """
        if not digits: return []
        phone = ['abc','def','ghi','jkl','mno','pqrs','tuv','wxyz']
        queue = ['']  # 初始化队列
        for digit in digits:
            for _ in range(len(queue)):
                tmp = queue.pop(0)
                for letter in phone[ord(digit)-50]:# 这里我们不使用 int() 转换字符串，使用ASCII码
                    queue.append(tmp + letter)
        return queue

"""
For Example:    input:   digits = "23"
               output:   ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]
"""
digits = "23"
                
solution = Solution()
result = solution.letterCombinations(digits)
print('输出为:', result)

参考

https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/solution/pythondian-hua-hao-ma-de-zi-mu-zu-he-by-jutraman/
https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/solution/hui-su-dui-lie-tu-jie-by-ml-zimingmeng/