Letter Combinations of a Phone Number

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

weixin_33831196

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

阅读量251

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/gattaca/p/4315884.html

本文解析了一道关于电话号码字母组合的算法题，通过使用C++实现，详细介绍了如何根据电话按键上的数字生成所有可能的字母组合。该算法利用了递归思想，通过将数字映射到对应的字母，然后进行字符串拼接，最终得到所有可能的组合。

摘要生成于 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.

　　这道题不算难，想想就出来了。

solution：

vector<string> letterCombinations(string digits) {
    int n = digits.size();
    vector<string> res;
    if(n == 0)
        return res;
    res.push_back("");
    string numap[] = {"#","#","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
    for (int i = 0;i < n;++i)
    {
        vector<string> tmp;
        for(int j = 0;j < res.size();++j)
            for(int k = 0;k < numap[digits[i]-'0'].size();++k)
                tmp.push_back(res[j] + numap[digits[i]-'0'][k]);
        res = tmp;
    }
    return res;
}