500. Keyboard Row

Given a List of words, return the words that can be typed using letters of alphabet on only one row’s of American keyboard like the image below.

Example 1:
Input: [“Hello”, “Alaska”, “Dad”, “Peace”]
Output: [“Alaska”, “Dad”]

Note:
You may use one character in the keyboard more than once.
You may assume the input string will only contain letters of alphabet.

answer：“`

class Solution {
public:
vector findWords(vector& words) {
int s=words.size();
vector out;
for(int i=0;i<=s-1;i++){
string x=words[i];
int ss=x.size()；
char fir=x.at(0);
bool is=1;
if(fir==’q’||fir==’Q’||fir==’w’||fir==’W’||fir==’e’||fir==’E’||fir==’r’||fir==’R’||fir==’t’||fir==’T’||fir==’y’||fir==’Y’||fir==’u’||fir==’U’||fir==’i’||fir==’I’||fir==’o’||fir==’O’||fir==’p’||fir==’P’){
for(int j=1;j<=ss-1;j++){
char y=x.at(j);
if(y==’q’||y==’Q’||y==’w’||y==’W’||y==’e’||y==’E’||y==’r’||y==’R’||y==’t’||y==’T’||y==’y’||y==’Y’||y==’u’||y==’U’||y==’i’||y==’I’||y==’o’||y==’O’||y==’p’||y==’P’){
continue;
}
else{
is=0;
break;
}
}
}
else if(fir==’a’||fir==’A’||fir==’s’||fir==’S’||fir==’d’||fir==’D’||fir==’f’||fir==’F’||fir==’g’||fir==’G’||fir==’h’||fir==’H’||fir==’j’||fir==’J’||fir==’k’||fir==’K’||fir==’l’||fir==’L’){
for(int j=1;j<=ss-1;j++){
char y=x.at(j);
if(y==’a’||y==’A’||y==’s’||y==’S’||y==’d’||y==’D’||y==’f’||y==’F’||y==’g’||y==’G’||y==’h’||y==’H’||y==’j’||y==’J’||y==’k’||y==’K’||y==’l’||y==’L’){
continue;
}
else{
is=0;
break;
}
}
}
else if(fir==’z’||fir==’Z’||fir==’x’||fir==’X’||fir==’c’||fir==’C’||fir==’v’||fir==’V’||fir==’b’||fir==’B’||fir==’n’||fir==’N’||fir==’m’||fir==’M’){
for(int j=1;j<=ss-1;j++){
char y=x.at(j);
if(y==’z’||y==’Z’||y==’x’||y==’X’||y==’c’||y==’C’||y==’v’||y==’V’||y==’b’||y==’B’||y==’n’||y==’N’||y==’m’||y==’M’){
continue;
}
else{
is=0;
break;
}
}
}

        if(is){
            out.push_back(x);
        }
    }
    return out;
}

};“`