给定一个仅包含数字 2-9 的字符串,返回所有它能表示的字母组合。
给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。
示例:
输入:“23”
输出:[“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”].
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题解:DFS
class Solution {
public:
vector<string> letterCombinations(string digits) {
vector<string> res;
if (!digits.size())
return res;
string letterMap[] = {
"", //0
"", //1
"abc", //2
"def", //3
"ghi", //4
"jkl", //5
"mno", //6
"pqrs", //7
"tuv", //8
"wxyz" //9
};
DFS(digits, res, "", 0, letterMap);
return res;
}
void DFS(string& digits, vector<string>& res, string s, int index, string* letterMap) {
if (index == digits.size()) {
res.push_back(s);
return;
}
int num = digits[index];
string letter = letterMap[num - '0'];
for (int i = 0; i < letter.size(); i ++) {
DFS(digits, res, s + letter[i], index+1, letterMap);
}
}
};