#leetcode#500 Keyboard Row

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:

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

======================================================================================================

没有太动脑子想一些简洁的代码, 通过这个题发现自己对  Arrays.asList(), list.toArray(), hashset.addAll() 这几个method用的不熟


public class Solution {
    public String[] findWords(String[] words) {
        if(words == null || words.length == 0)
            return new String[]{};
            
        List<String> res = new ArrayList<>();
        Set<Character> set1 = new HashSet<>();
        Set<Character> set2 = new HashSet<>();
        Set<Character> set3 = new HashSet<>();
        Character[] arr1 = new Character[]{'Q','q','W','w','E','e','R','r','T','t','Y','y','U','u','I','i','O','o','P','p'};
        Character[] arr2 = new Character[]{'A','a','S','s','D','d','F','f','G','g','H','h','J','j','K','k','L','l'};
        Character[] arr3 = new Character[]{'Z','z','X','x','C','c','V','v','B','b','N','n','M','m'};
        set1.addAll(Arrays.asList(arr1));
        set2.addAll(Arrays.asList(arr2));
        set3.addAll(Arrays.asList(arr3));
        
        for(String s : words){
            boolean row1 = false;
            boolean row2 = false;
            boolean row3 = false;
            for(int i = 0; i < s.length(); i++){
                Character c = s.charAt(i);
                if(set1.contains(c))
                    row1 = true;
                else if(set2.contains(c))
                    row2 = true;
                else if(set3.contains(c))
                    row3 = true;
            }
            
            if((row1 && !row2 && ! row3) || (!row1 && row2 && !row3) || (!row1 && !row2 && row3)){
                    res.add(s);
            }
        }
        
        // String[] result = new String[res.size()];    //also works
        // return res.toArray(result);                      
        return res.toArray(new String[0]);
    }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值