Keyboard Row(leetcode)
来源:互联网 发布:python re group 编辑:程序博客网 时间:2024/06/05 19:01
Keyboard Row
- Keyboard Row
- 题目
- 解决
题目
leetcode题目
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.
解决
class Solution {public: vector<string> findWords(vector<string>& words) { vector<string> result; char r1[] = {'q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p'}; char r2[] = {'a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l'}; char r3[] = {'z', 'x', 'c', 'v', 'b', 'n', 'm'}; // 分别用set来存储对应的字符,方便判断字符对应的位置 set<char> up(r1, r1 + 10); set<char> mid(r2, r2 + 9); set<char> down(r3, r3 + 7); int u, m, d; for (int i = 0; i < words.size(); i++) { u = 0; m = 0; d = 0; for (int j = 0; j < words[i].length(); j++) { // 判断字符是否在第一行 if (up.count(words[i][j]) == 1) u = 1; // 判断字符是否在第二行 if (mid.count(words[i][j]) == 1) m = 1; // 判断字符是否在第三行 if (down.count(words[i][j]) == 1) d = 1; // 判断字符串中的字符是否由同一行的字符组成 if (u + m + d > 1) break; } // 将满足条件的字符串记录下来 if (u + m + d == 1) result.push_back(words[i]); } return result; }};
阅读全文
0 0
- Leetcode-500. Keyboard Row
- 【Leetcode】500. Keyboard Row
- leetcode-500-Keyboard Row
- 【LeetCode】500. Keyboard Row
- LeetCode 500. Keyboard Row
- leetcode 500 keyboard row
- LeetCode 500. Keyboard Row
- Leetcode-Algorithms Keyboard Row
- [LeetCode]Keyboard Row - Python
- LeetCode:Keyboard Row
- leetcode 500. Keyboard Row
- Leetcode #500 Keyboard Row
- LeetCode 500 Keyboard Row
- [LeetCode]500. Keyboard Row
- LeetCode | 500. Keyboard Row
- [LeetCode]500. Keyboard Row
- LeetCode 500. Keyboard Row
- 【LeetCode】500. Keyboard Row
- 网易邮箱——fullpage
- Java数据库连接池详解
- [noip2011]聪明的质监员
- 排序算法
- Kafka:High level consumer vs. Low level consumer
- Keyboard Row(leetcode)
- S
- C++创建多级目录
- 腾讯云CVM服务器安装宝塔面板 快速安装可视化网站管理环节
- 1.2.在linux环境实践,使用vim编写一个程序,然后使用gcc查看【预处理】、【编译】、【汇编】、【链接】各阶段文件的内容。并熟悉相关指令。
- javascript----原型总结(2)(显示原型与隐式原型)
- 发布包到应用市场前,检验版本号等信息
- 统计学习方法——模型的选择与评估(过拟合、泛化能力)
- 2017沈阳站现场赛打表程序 F Heron and his Triange