Hash Table -- Leetcode problem500: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.

• 分析：这是一道比较简单的题目，要求从所给输入中选择利用键盘一行可以输出的单词。
• 思路一：这道题我选用了map和set作为存放相关数据的容器，首先用set存放键盘每行的字母（map操作相对数组简单），然后根据input判断字母是否在set中，通过map记录字母个数后与字符串长度进行对比，最后输出结果。

class Solution {
public:
    vector<string> findWords(vector<string>& words) {
    map<int, int> my_map;
    set<char> row1 {'q', 'w', 'e', 'r', 't', 'y','u', 'i', 'o', 'p'};
    set<char> row2 {'a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l'};
    set<char> row3 { 'z', 'x', 'c', 'v', 'b' ,'n', 'm'};
    vector<string> validWords;
    for(int j=0; j< words.size(); j++){
        my_map.clear();
        int flag1 = 0, flag2 = 0, flag3 = 0;
        for (int i = 0 ; i < words[j].size(); i++) {

           if (row1.count((char)tolower(words[j][i]))) {
                my_map[1] = ++flag1;
            } else if (row2.count((char)tolower(words[j][i]))) {
                my_map[2] = ++flag2;
            } else if (row3.count((char)tolower(words[j][i]))) {
                my_map[3] = ++flag3;
            }
        }
        if (flag1 == words[j].size() || flag2 == words[j].size()|| flag3 == words[j].size()) {
            validWords.push_back(words[j]);
        }
    }
    return validWords;
}
};