LeetCode:500.键盘行

最新推荐文章于 2021-11-14 23:40:04 发布

dos diosas

最新推荐文章于 2021-11-14 23:40:04 发布

阅读量87

点赞数

分类专栏： # LeetCode

本文链接：https://blog.csdn.net/dosdiosas_/article/details/105933938

版权

LeetCode 专栏收录该内容

273 篇文章 0 订阅

订阅专栏

class Solution {
public:
    bool judge(string obj)
    {
        map<char,int> map1={
            {'q',0},{'w',0},{'e',0},{'r',0},{'t',0},{'y',0},{'u',0},{'i',0},                                {'o',0},{'p',0},{'a',1},{'s',1},{'d',1},{'f',1},{'g',1},{'h',1},                                {'j',1},{'k',1},{'l',1},{'z',2},{'x',2},{'c',2},{'v',2},{'b',2},                                {'n',2},{'m',2},{'Q',0},{'W',0},{'E',0},{'R',0},{'T',0},{'Y',0},                                {'U',0},{'I',0},{'O',0},{'P',0},{'A',1},{'S',1},{'D',1},{'F',1},                                {'G',1},{'H',1},{'J',1},{'K',1},{'L',1},{'Z',2},{'X',2},{'C',2},                                {'V',2},{'B',2},{'N',2},{'M',2}
            };
            char c=obj[0];
            int res=map1[c];
            for(int i=0;i<obj.size();i++)
            {
                if(map1[obj[i]]!=res)
                {
                    return false;
                }
            }
            return true;
    }
    vector<string> findWords(vector<string>& words) {
        vector<string>res;
        for(int i=0;i<words.size();i++)
        {
            if(judge(words[i]))
            {
                res.push_back(words[i]);
            }
        }
        return res;
    }
};