500. Keyboard Row

最新推荐文章于 2018-03-17 11:29:38 发布

原创最新推荐文章于 2018-03-17 11:29:38 发布 · 257 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种算法，用于从给定的字符串数组中筛选出所有字母均位于美式键盘同一行的单词。通过对比输入单词与键盘布局，实现高效筛选。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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”]

理解题意：题目的意思是，给定一个字符串数组，输出的字符串数组中的元素满足一下条件——字符串中的每个元素都在美式键盘的同一行。

public String[] findWords(String[] words) {
        /**
         * 分析：给出n个字符串，从而判断每个字符串中的字符石头来自美式键盘上的同一行，若来自同一行，返回该string。
        **/
        char[] row_1 = {'q','w','e','r','t','y','u','i','o','p','Q','W','E','R','T','Y','U','I','O','P'}; 
        char[] row_2 = {'a','s','d','f','g','h','j','k','l','A','S','D','F','G','H','J','K','L'};
        char[] row_3 = {'z','x','c','v','b','n','m','Z','X','C','V','B','N','M'};

        String[] tempWords = new String[words.length];
        int t = 0;
        boolean flag = true;
        for (int i = 0; i < words.length; i++) {

            boolean b = check_1(words[i], row_1, row_2, row_3);
            //System.out.print(b + ",");

            if(b){
                tempWords[t] = words[i];
                t += 1;
            }
        }
        //System.out.println(Arrays.toString(tempWords));
        String[] newWords = new String[t];
        newWords = copyArr(tempWords, t);
        return newWords;

    }

    public boolean check_1(String str,char[] c1,char[] c2,char[] c3){
        return check(str, c1) || check(str, c2) || check(str, c3);
    }

    /*
     * 判断一个字符串是否来之同一行键
     */
    public boolean check(String str, char[] charArr) {
        char[] tempWord = str.toCharArray();
        int count = 0;
        for (int i = 0; i < tempWord.length; i++) {
            if (isContain(charArr, tempWord[i])) {
                count += 1;
            }
        }
        if (count == tempWord.length) {
            return true;
        }
        return false;
    }
    public static String[] copyArr(String[] arr, int n) {
        String[] retArr = new String[n];
        for (int i = 0; i < arr.length; i++) {
            if (i < n) {
                retArr[i] = arr[i];
            } else {
                break;
            }
        }
        return retArr;
    }

    // 检查数组中是否包含某个元素
    public static boolean isContain(char[] arr, char c) {
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] == c) {
                return true;
            }
        }
        return false;
    }