思想:
DFS
class Solution {
public:
const vector<string> dict={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
void dfs(string digits, int depth, string path, vector<string> &res) {
if(depth == digits.size()) {
res.push_back(path);
return;
}
for(auto c: dict[digits[depth] - '0']) {
dfs(digits, depth+1, path+c, res);
}
}
vector<string> letterCombinations(string digits) {
vector<string> res;
if(digits.size() == 0) return res;
dfs(digits, 0, "", res);
return res;
}
};