class Solution {
public:
vector<string> findWords(vector<string>& words) {
int alpha[26] ={1,2,2,1,0,1,1,1,0,1,1,1,2,2,0,0,0,0,1,0,0,2,0,2,0,2};
vector<string> res;
for(int i=0;i<words.size();i++)
{
int cls;
if(words[i][0]<='Z'&&words[i][0]>='A')
cls = alpha[words[i][0]-'A'];
else
cls = alpha[words[i][0]-'a'];
int j=1;
for(j=1;j<words[i].length();j++)
{
int cls1;
if(words[i][j]<='Z'&&words[i][j]>='A')
cls1 = alpha[words[i][j]-'A'];
else
cls1 = alpha[words[i][j]-'a'];
if(cls1!=cls)break;
}
if(j>=words[i].length())res.push_back(words[i]);
}
return res;
}
};