class Solution {
private:
const string letterMap[10]={
" ",
"",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
vector<string> res;
void temp(const string digits, int index, string s){
if( index == digits.size() ){
res.push_back(s);
return ;
}
char c = digits[index];
string aim = letterMap[c-'0'];
for(int i = 0 ; i < aim.size(); i ++ ){
temp(digits, index+1, s + aim[i]);
}
}
public:
vector<string> letterCombinations(string digits) {
res.clear();
if( digits.size() == 0 )
return res;
temp(digits, 0, "");
return res;
}
};
递归和回溯问题(一)—— leetcode17
最新推荐文章于 2022-12-13 17:18:11 发布