500

500. Keyboard Row (Easy)

Given an array of strings words, return the words that can be typed using letters of the alphabet on only one row of American keyboard like the image below.

In the American keyboard:

• the first row consists of the characters "qwertyuiop",
• the second row consists of the characters "asdfghjkl", and
• the third row consists of the characters "zxcvbnm".

 

Example 1:

Input: words = ["Hello","Alaska","Dad","Peace"]
Output: ["Alaska","Dad"]

Example 2:

Input: words = ["omk"]
Output: []

Example 3:

Input: words = ["adsdf","sfd"]
Output: ["adsdf","sfd"]

 

Constraints:

• 1 <= words.length <= 20
• 1 <= words[i].length <= 100
• words[i] consists of English letters (both lowercase and uppercase). 

Companies:
Mathworks

Related Topics:
Array, Hash Table, String

Solution 1.

// OJ: https://leetcode.com/problems/keyboard-row/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(1)
const string keyboard[3] = {"qwertyuiop", "asdfghjkl", "zxcvbnm"};
int m[26] = {};
static const auto __init__ = []() {
    for (int i = 0; i < 3; ++i) {
        for (char c : keyboard[i]) m[c - 'a'] = i;
    }
    return 0;
}();
class Solution {
public:
    vector<string> findWords(vector<string>& A) {
        vector<string> ans;
        for (auto &s : A) {
            int i = -1;
            for (char c : s) {
                int j = m[tolower(c) - 'a'];
                if (i == -1) i = j;
                else if (j != i) {
                    i = -1;
                    break;
                }
            }
            if (i != -1) ans.push_back(s);
        }
        return ans;
    }
};