17. 电话号码的字母组合

江小北

于 2021-05-04 11:33:20 发布

阅读量131

点赞数

分类专栏：算法刷题笔记

本文链接：https://blog.csdn.net/FeNGQiHuALOVE/article/details/116398841

版权

算法刷题笔记专栏收录该内容

157 篇文章 0 订阅

订阅专栏

在这里插入图片描述

深度搜索

class Solution:
    def letterCombinations(self, digits: str) -> List[str]:
        ans = []
        if not digits:
            return ans
        phoneMap = {
            "2": "abc",
            "3": "def",
            "4": "ghi",
            "5": "jkl",
            "6": "mno",
            "7": "pqrs",
            "8": "tuv",
            "9": "wxyz",}
        def backtrack(position, sub_res):
            if len(sub_res) == len(digits):
                ans.append("".join(sub_res[:]))
                return
            for i in range(position, len(digits)):
                position = position + 1
                for j in range(len(phoneMap[digits[i]])):
                    sub_res.append(phoneMap[digits[i]][j])
                    backtrack(position, sub_res)
                    sub_res.pop()
                # position = position - 1
        backtrack(0, [])
        return ans

广度搜索

class Solution:
    def letterCombinations(self, digits: str) -> 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[int(digit)-2]:
                    queue.append(tmp + letter)
        return queue