17 电话号码的字母组合
startIndex记录输入字符串遍历的位置
通过startIndex获取对应电话簿字母串str
遍历字母串str将其加入str
class Solution {
private:
unordered_map<int, string> phoneTable = {
{2, "abc"}, {3, "def"}, {4, "ghi"}, {5, "jkl"},
{6, "mno"}, {7, "pqrs"}, {8, "tuv"}, {9, "wxyz"},
};
vector<string> ans;
string path;
int k;
void dfs(string& digits, string& path, int k, int startIndex) {
if (k == 0) {
ans.push_back(path);
return;
}
string str = phoneTable[digits[startIndex] - '0'];
for (char letter : str) {
path.push_back(letter);
dfs(digits, path, k - 1, startIndex + 1);
path.pop_back();
}
}
public:
vector<string> letterCombinations(string digits) {
if (!digits.empty()) {
k = digits.size();
dfs(digits, path, k, 0);
}
return ans;
}
};