500. Keyboard Row

最新推荐文章于 2024-05-28 20:47:24 发布

zg1g

最新推荐文章于 2024-05-28 20:47:24 发布

阅读量620

点赞数 2

分类专栏：算法/LeetCode 经典算法，LeetCode题目研究文章标签： leetcode 哈希

本文链接：https://blog.csdn.net/daigualu/article/details/71447614

版权

经典算法，LeetCode题目研究同时被 2 个专栏收录

225 篇文章 18 订阅

订阅专栏

算法/LeetCode

223 篇文章 1 订阅

订阅专栏

原题

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”]

代码实现

  public string[] FindWords(string[] words)
        {
            int[] hash = new int[123];
            char[] chs1 = {'q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p'};
            foreach (var ch in chs1)
            {
                hash[Convert.ToInt32(ch)] = 1; //q
                hash[Convert.ToInt32(ch)-32] = 1; //Q
            }
            chs1 = new[] {'a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l'};
            foreach (var ch in chs1)
            {
                hash[Convert.ToInt32(ch)] = 2;
                hash[Convert.ToInt32(ch) - 32] = 2;
            }
            chs1 = new[] {'z', 'x', 'c', 'v', 'b', 'n', 'm'};
            foreach (var ch in chs1)
            {
                hash[Convert.ToInt32(ch)] = 3;
                hash[Convert.ToInt32(ch) - 32] = 3;
            }
            List<string> rtn = new List<string>();
            foreach (var word in words)
            {
                if(string.IsNullOrEmpty(word)) continue;
                int row = hash[word[0]];
                bool allflag = true;
                foreach (var ch in word)
                {
                    if (hash[ch] != row)
                    {
                        allflag = false;
                        break;
                    }
                }
                if(allflag==true) rtn.Add(word);
            }
            return rtn.ToArray();
        }