(leetcode) 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.

 take your keyboard as an example 

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

Input: ["Hello", "Alaska", "Dad", "Peace"]
Output: ["Alaska", "Dad"]

意思是检查字符串 是不是由一行输出的，只限字母，包括大小写

思路是把小写换成大写，这样字母表Ascii值就连续了，用一个长度26哈希表的，储存26个字符

属于第一列的值001,第二列的值010，第三列值100，检查是否为同一列 只要把该字符串的每个哈希值相与，结果不为0则为同一列

vector<string> findWords(vector<string>& words) {
string a[3]={
                "ASDFGHJKL",
"QWERTYUIOP",
"ZXCVBNM"};
vector<int>bucket(26);
vector<string>result;
   for(int i=0;i<3;i++)
   {
       for(char c:a[i])
           bucket[toupper(c)-'A']=1<<i;  //001 010 100
       }
   }
   for(auto i: words)
   {   
           int t=7;
           for(char c:i)
           {   
               t&=bucket[toupper(c)-'A'];
           }
           if(t)
           result.push_back(i);
   }

   return result;

}