给定一个仅包含数字 2-9
的字符串,返回所有它能表示的字母组合。
给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。
class Solution {
public:
vector<string> letterCombinations(string digits) {
vector<string> s;
string temp;
map<char,string> maps;
int count=0;
maps['2'] = "abc";
maps['3'] = "def";
maps['4'] = "ghi";
maps['5'] = "jkl";
maps['6'] = "mno";
maps['7'] = "pqrs";
maps['8'] = "tuv";
maps['9'] = "wxyz";
if(digits.length()==0)
{return s;}
temp=maps[digits[0]];
for(int i = 0;i<temp.length();i++)
{
//printf("temp[i]=%c\n",temp[i] );
string s1="";
s1.push_back(temp[i]);
s.push_back( s1 ) ;
}
for(int m=1;m<digits.size();m++)
{
//当前数字对应的字符串
temp=maps[digits[m]];
int len=s.size();
count=0;
while(count<len)
{
for(int i = 0;i<temp.length();i++)
{
s.push_back(s[0]+temp[i]);
}
s.erase(s.begin());
count++;
}
}
return s;
}
};