LeetCode.KeyboardRow

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.

implements.1

public static String[] findWords(String[] words) {
        String a1[] = { "q", "w", "e", "r", "t", "y", "u", "i", "o", "p" };
        String a2[] = { "a", "s", "d", "f", "g", "h", "j", "k", "l" };
        String a3[] = { "z", "x", "c", "v", "b", "n", "m" };
        char ch[];
        int i1 = 0;
        int i2 = 0;
        int i3 = 0;
        List<String> list = new ArrayList<String>();
        for (String str : words) {
            ch = str.toLowerCase().toCharArray();
            for (char c : ch) {
                if (Arrays.asList(a1).contains(String.valueOf(c))) {
                    i1++;
                    if (i1 == ch.length) {
                        list.add(str);
                        continue;
                    }
                }
            }
            for (char c : ch) {
                if (Arrays.asList(a2).contains(String.valueOf(c))) {
                    i2++;
                    if (i2 == ch.length) {
                        list.add(str);
                        continue;
                    }
                }
            }
            for (char c : ch) {
                if (Arrays.asList(a3).contains(String.valueOf(c))) {
                    i3++;
                    if (i3 == ch.length) {
                        list.add(str);
                        continue;
                    }
                }
            }
            i1 = 0;
            i2 = 0;
            i3 = 0;
        }
        return list.toArray(new String[] {});
    }

implements.2

public static String[] findWordss(String[] words) {
        return Stream.of(words).filter(s -> s.toLowerCase().
                matches("[zxcvbnm]*|[asdfghjkl]*|[qwertyuiop]*"))
                .toArray(String[]::new);
    }
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值