题目链接:https://leetcode-cn.com/problems/keyboard-row/
题目如下:
class Solution {
public:
vector<string> findWords(vector<string>& words) {
unordered_set<char> uset1 {'q','w','e','r','t','y','u','i','o','p'};
unordered_set<char> uset2 {'a','s','d','f','g','h','j','k','l'};
unordered_set<char> uset3 {'z','x','c','v','b','n','m'};
vector<string> result;
for(auto str:words){
if(uset1.count(str[0])>0||uset1.count(str[0]+32)>0) judge(result,uset1,str);
else if(uset2.count(str[0])>0||uset2.count(str[0]+32)>0) judge(result,uset2,str);
else if(uset3.count(str[0])>0||uset3.count(str[0]+32)>0) judge(result,uset3,str);
}
return result;
}
void judge(vector<string>& result,unordered_set<char> uset,string str){
int i;
for(i=0;i<str.size();i++)
if(uset.count(str[i])==0&&uset.count(str[i]+32)==0) break;
if(i==str.size()) result.push_back(str);
}
};