M17.电话号码的字母组合(遍历)

题目链接

解析:

给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。

给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。

示例:

输入：“23”
输出：[“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”].

solution:

class Solution {
public:
    vector<string> letterCombinations(string digits) {
         if(digits.empty()) return {};
         vector<string> res;
         vector<string> dict{"","","abd","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
         LDFS(digits,dict,0,"",res);
         return res;
    }
    void LDFS(string& digits,vector<string>& dict,int level,string out,vector<string>& res)
    {
        if(level == digits.size())
        {
            res.push_back(out);
            return;
        }
        string str = dict[digits[level]-'0'];//获取每个数字表示的字母
        for(int i=0;i<(int)str.size();i++)
        {
            LDFS(digits,dict,level+1,out+str[i],res);
        }
    }
};