LeetCode 17. Letter Combinations of a Phone Number

最新推荐文章于 2025-05-25 20:50:12 发布

zhb1nk

最新推荐文章于 2025-05-25 20:50:12 发布

阅读量146

点赞数 1

CC 4.0 BY-SA版权

分类专栏： LeetCode 题解 C++版

本文链接：https://blog.csdn.net/zhaohaibo_/article/details/86475855

LeetCode 题解 C++版专栏收录该内容

138 篇文章

订阅专栏

本文介绍了一种解决LeetCode上LetterCombinations问题的方法，通过深度优先搜索(DFS)算法生成所有可能的字母组合，对应于给定的数字串。文章详细解释了如何使用递归实现DFS，并提供了一个C++代码示例。

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

Letter Combinations of a Phone Number - LeetCode

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.

学到的这种初始化方式

char ops[10][5] = {"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};

class Solution {
public:
    vector<string> ans;
    char ops[10][5] = {"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
    vector<string> letterCombinations(string digits) {
        dfs(digits, 0, "");
        return ans;
    }
    // digits中第num个数
    void dfs(string digits, int num, string path) {
        if (num == digits.size()) {
            if(path.size())
                ans.push_back(path);
            return;
        }
        
        int c = digits[num] - '0';
        for (int i = 0; ops[c][i]; i ++ )
            dfs(digits, num + 1, path + ops[c][i]);
    }
};