题目
给定一个数字字符串,返回数字所有可能表示的字母组合。
下面给出数字到字母的映射(和电话号码一样)。
输入:数字字符串 “23”
输出:[“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”].
说明:
尽管上面的答案是按字典序排列的,但是你的答案可以是任何顺序。
代码
class Solution {
public:
vector<string> letterCombinations(string digits) {
vector<string> s1,s2;
map<char,vector<string>> mp;
mp['2']={"a","b","c"};
mp['3']={"d","e","f"};
mp['4']={"g","h","i"};
mp['5']={"j","k","l"};
mp['6']={"m","n","o"};
mp['7']={"p","q","r","s"};
mp['8']={"t","u","v"};
mp['9']={"w","x","y","z"};
for(auto &ch:digits){
int size=s1.size();
auto &v=mp[ch];
for(auto &s:v){
for(int i=0;i<size;i++){
string tmp=s1[i]+s;
s2.push_back(tmp);
}
if(size==0) s2.push_back(s);
}
swap(s1,s2);
s2.clear();
}
return s1;
}
};