500. Keyboard Row

最新推荐文章于 2019-10-30 17:37:27 发布

SalaFeng是一条咸鱼

最新推荐文章于 2019-10-30 17:37:27 发布

阅读量230

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/u013248806/article/details/65632892

LeetCode 专栏收录该内容

22 篇文章

订阅专栏

本文介绍了一个算法问题，即如何找出可以使用美国键盘某一行字母组成的单词。通过将键盘上每行的字符存储到对应的集合中，并遍历输入的单词列表进行匹配，实现了一种高效的解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

American keyboard

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.

分析：vector<string>&word 给出N个字符串将键盘上的每一行字符存储到对应的vector中，然后循环 word中的每一个string

class Solution {
public:
    vector<string> findWords(vector<string>& words) {
        unordered_set<char> set1 = {'Q','q','W','w','E','e','R','r','T','t','Y','y','U','u','I','i','O','o','P','p'};  
        unordered_set<char> set2 = {'S','s','D','d','F','f','G','g','H','h','J','j','K','k','L','l','a','A'};  
        unordered_set<char> set3 = {'Z','z','X','x','C','c','V','v','B','b','N','n','M','m'};  
        vector<unordered_set<char>> sets = {set1, set2, set3}; 
        vector<string> out;  
        for(int i =0;i<words.size();i++){
            int index =0;
            if(set1.find(words[i][0]) !=set1.end()) index =0;
            else if(set2.find(words[i][0]) !=set2.end()) index =1;
            else if(set3.find(words[i][0]) !=set3.end()) index =2;
            unordered_set<char> tmp =sets[index];
            int flag= 0;
            for(char c:words[i]){
                if(tmp.find(c) !=tmp.end()) continue;
                else {
                    flag =1;
                    break;
                }
            }
            if(!flag) out.push_back(words[i]);
        }
        return out;
    }
};