17. Letter Combinations of a Phone Number

最新推荐文章于 2024-01-18 13:57:19 发布

原创最新推荐文章于 2024-01-18 13:57:19 发布 · 393 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 同时被 2 个专栏收录

166 篇文章

订阅专栏

2016刷题

45 篇文章

订阅专栏

本文介绍了一个算法问题：给定一个数字字符串，返回所有可能的字母组合。文章提供了一个Python类解决方案，通过深度优先搜索实现所有可能的组合。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

do a dfs search to see all the combinations.

class Solution(object):
    def letterCombinations(self, digits):
        """
        :type digits: str
        :rtype: List[str]
        """
        NUMBER_HASH={'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']
             }
        digit_length = len(digits)
        def dfs(number_length, string, result):
            if number_length == digit_length:
                result.append(string)
                return
            for letter in NUMBER_HASH[digits[number_length]]:
                dfs(number_length + 1, string + letter, result)
        result = []
        if len(digits) == 0:
            return result
        dfs(0, '', result)
        return result