(1)递归
class Solution {
private:
string str[10]={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
public:
vector<string> letterCombinations(string digits) {
vector<string> vec,v;
if(digits.length()==0) return {};
else if(digits.length()==1) {
for(int i=0;i<str[digits[0]-'0'].length();i++) {
v.push_back(string(1,str[digits[0]-'0'][i]));
}
return v;
}
v=letterCombinations(digits.substr(1));
for(int i=0;i<str[digits[0]-'0'].length();i++) {
for(int j=0;j<v.size();j++) {
vec.push_back(str[digits[0]-'0'][i]+v[j]);
}
}
return vec;
}
};