500. Keyboard Row

最新推荐文章于 2024-11-23 18:25:02 发布

kakitgogogo

最新推荐文章于 2024-11-23 18:25:02 发布

阅读量366

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： string

本文链接：https://blog.youkuaiyun.com/kakitgogogo/article/details/54908674

leetcode 专栏收录该内容

230 篇文章

订阅专栏

本文介绍了一个算法问题，即如何找出给定单词列表中那些字母仅位于标准美国键盘同一行的单词。通过使用C++实现的具体代码示例，文章详细解释了如何构建字母到键盘行的映射，并遍历每个单词来确定其所有字母是否在同一行。

摘要生成于 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.

Subscribe to see which companies asked this question.

判断一个单词的字母是否都在键盘的同一行。

代码：

class Solution
{
public:
	vector<string> findWords(vector<string>& words) 
	{
		s = "QWERTYUIOP";
		make_map(1);
		s = "ASDFGHJKL";
		make_map(2);
		s = "ZXCVBNM";
		make_map(3);

		vector<string>res;
		for(auto word:words)
		{
			int n = 0;
			for(auto c:word)
			{
				int k = toupper(c) - 'A';
				if(n != 0 && n != map[k]) 
				{
					n = 4;
					break;
				}
				n = map[k];
			}
			if(n < 4) res.push_back(word);
		}
		return res;
	}
private:
	int map[26];
	string s;
	void make_map(int n)
	{
		for(auto c:s)
		{
			map[c-'A'] = n;
		}
	}
};