class Solution {
public:
string V[10] = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
vector<string> ans;
void letterCombinations(const string& digits, int ind, string temp) {
if(ind == digits.size()) {
ans.push_back(temp);
return ;
}
for(auto ch : V[digits[ind] - '0']) {
letterCombinations(digits, ind+1, temp + ch);
}
}
vector<string> letterCombinations(string digits) {
if(digits != "") letterCombinations(digits, 0, "");
return ans;
}
};
leetcode 17. 电话号码的字母组合
最新推荐文章于 2023-08-25 12:20:00 发布