[LeetCode] Letter Combinations of a Phone Number

hale1007

于 2014-10-23 13:57:46 发布

阅读量414

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode Algorithm

本文链接：https://blog.youkuaiyun.com/hale1007/article/details/40395897

Algorithm 同时被 2 个专栏收录

86 篇文章

订阅专栏

LeetCode

76 篇文章

订阅专栏

本文介绍了一种将数字字符串转换为对应字母组合的方法，详细解释了如何通过按键映射表实现这一功能。

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

class Solution {
public:
    vector<string> letterCombinations(string digits) {
        string path;
        vector<string> res;
        int step = 0;
        dfs(step, path, res, digits);
        return res;
    }
    void dfs(int step, string &path, vector<string> &res, const string &digits)
    {
        const static string strT[10] = {"", "", "abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
        if(step == digits.size())
        {
            res.push_back(path);
            return;
        }
        for(int i = 0; i < strT[digits[step]-'0'].size(); i++)
        {
            path.push_back(strT[digits[step]-'0'][i]);
            dfs(step+1, path, res, digits);
            path.pop_back();
        }
    }
};