class Solution {
public:
vector<string> s={" "," ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
vector<string>ans;
string cnt;
void dfs(int pos,string digits){
if(pos==digits.size()){
ans.push_back(cnt);
return ;
}
int n=digits[pos]-'0';
for(int i=0;i<s[n].size();i++){
cnt.push_back(s[n][i]);
dfs(pos+1,digits);
cnt.pop_back();
}
}
vector<string> letterCombinations(string digits) {
if(digits=="")return {};
dfs(0,digits);
return ans;
}
};
17. 电话号码的字母组合
最新推荐文章于 2024-09-13 16:27:15 发布