首页 > itarticle > [leetcode] problem 500 – keyboard row

[leetcode] problem 500 – keyboard row

admin 11月 13, 2020 0

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

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.

Code

private String[] rows = {"qwertyuiop", "asdfghjkl", "zxcvbnm"};

public String[] findWords(String[] words) {
    List<String> result = new ArrayList<>();

    for (String word : words) {
        for (String row : rows) {
            if (check(word.toLowerCase(), row)) {
                result.add(word);
                break;
            }
        }
    }
    
    return result.toArray(new String[result.size()]);
}

private boolean (String word, String row) {
    for (char ch : word.toCharArray()) {
        if (row.indexOf(ch) == -1)
            return false;
    }

    return true;
}