思路:dfs
class Solution {
private:
string letterMap[10] = {
"", "",
"abc", "def", "ghi", "jkl",
"mno", "pqrs", "tuv", "wxyz",
};
public:
vector<string> res;
string str;
void dfs(const string& digits, int index) {
if (index == digits.size()) {
res.push_back(str);
return;
}
int digit = digits[index] - '0';
string letter = letterMap[digit];
for (int i = 0; i < letter.size(); ++i) {
str.push_back(letter[i]);
dfs(digits, index+1);
str.pop_back();
}
}
vector<string> letterCombinations(string digits) {
str.clear();
res.clear();
if (digits.empty()) return res;
dfs(digits, 0);
return res;
}
}
ORZ