Keyboard Row：判断一组字符串是否只属于某一个集合中

最新推荐文章于 2022-12-05 17:14:01 发布

想改名的小雄鹿

最新推荐文章于 2022-12-05 17:14:01 发布

阅读量307

点赞数

分类专栏： Leetcode 文章标签： Java Leecode

本文链接：https://blog.csdn.net/u013300579/article/details/78849134

版权

Leetcode 专栏收录该内容

188 篇文章 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"]

Note:

You may use one character in the keyboard more than once.
You may assume the input string will only contain letters of alphabet.

解释：这道题不区分大小写，困惑......键盘上不是有caps lock 和shift吗.....

思路：把<键值,行号>保存到hash表中，然后对每一个字符串中每个字符，查号相应行号，若存在行号不同则不添加进结果中。

class Solution {
    //这道题是忽略大小写的
	public String[] findWords(String[] words) {
        String[] strs = {"QWERTYUIOP","ASDFGHJKL","ZXCVBNM"};
        Map<Character, Integer> map = new HashMap<>();
        for(int i = 0; i<strs.length; i++){
            for(char c: strs[i].toCharArray()){
                map.put(c, i);//put <char, rowIndex> pair into the map
            }
        }
        List<String> res = new LinkedList<>();
        for(String w: words){
            if(w.equals("")) continue;
            int index = map.get(w.toUpperCase().charAt(0));
            for(char c: w.toUpperCase().toCharArray()){
                if(map.get(c)!=index){
                    index = -1; //don't need a boolean flag. 
                    break;
                }
            }
            if(index!=-1) res.add(w);//if index != -1, this is a valid string
        }
        return res.toArray(new String[0]);
    }
}

参考：https://leetcode.com/problems/keyboard-row/discuss/