题目来源
题目描述
题目解析
class Solution {
public:
vector<string> findWords(vector<string>& words) {
vector<string> ret;
unordered_set<char> myset1{ 'q','w','e','r','t','y','u','i','o','p','Q','W','E','R','T','Y','U','I','O','P' };
unordered_set<char> myset2{ 'a','s','d','f','g','h','j','k','l','A','S','D','F','G','H','J','K','L' };
unordered_set<char> myset3{ 'z','x','c','v','b','n','m','Z','X','C','V','B','N','M' };
for (string str : words)
{
int flag1 = 0, flag2 = 0, flag3 = 0;
for (char ch : str)
{
if (myset1.count(ch)) flag1 = 1;
else if (myset2.count(ch)) flag2 = 1;
else if (myset3.count(ch)) flag3 = 1;
}
if (1 == flag1 + flag2 + flag3) ret.push_back(str);
}
return ret;
}
};