莫名其妙
class Solution {
public:
vector<string> letterCombinations(string digits) {
vector<string> vs(1,"");
vector<string> ret;
if(!digits.size()) return ret;
string s;
vector<string>hash(10,"");
int i,j,k,end;
hash[2]="abc";
hash[3]="def";
hash[4]="ghi";
hash[5]="jkl";
hash[6]="mno";
hash[7]="pqrs";
hash[8]="tuv";
hash[9]="wxyz";
int n=digits.size();
for(i=0,j=0;i<(n-1);++i)
{
end=vs.size();
for(;j<end;++j)
{
s=vs[j];
for(k=0;k<hash[digits[i]-'0'].size();++k)
{
vs.push_back(s+hash[digits[i]-'0'][k]);
}
}
}
end=vs.size();
for(;j<end;++j)
{
s=vs[j];
for(k=0;k<hash[digits[n-1]-'0'].size();++k)
{
ret.push_back(s+hash[digits[n-1]-'0'][k]);
}
}
return ret;
}
};