[LeetCode]500. Keyboard Row

最新推荐文章于 2024-10-06 16:32:56 发布

yunguopiaoyu

最新推荐文章于 2024-10-06 16:32:56 发布

阅读量194

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/hanyunpiaoyu/article/details/78074027

版权

LeetCode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Description

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.
下面是我写的代码，写完之后我突然发现判断每个字符串在键盘某一行的个数和该字符串的长度比较会更简单一些，以后会把这个代码补上。

class Solution {
    public String[] findWords(String[] words) {
     String line1 = "qwertyuiopQWERTYUIOP";
     String line2 = "asdfghjklASDFGHJKL";
     String line3 = "zxcvbnmZXCVBNM";
     int line = 1;
     int n = words.length;
     int[] index = new int[n]; 
     for( int i=0; i<n; i++)
         index[i] = -1;
     int count = 0;
     for(int i=0; i<n; i++){
         if(allIn(words[i],line1) || allIn(words[i],line2) || allIn(words[i],line3))
             index[count++] = i;         
     }
     count = 0;
     for(int i=0; i<n; i++){
         if(index[i]!=-1)
             count ++;
     }
     String[] res = new String[count];
     count = 0;
     for(int i=0; i<n; i++){
        if(index[i]!=-1)
          res[count++] = words[index[i]];
     }
        return res;
    }
    public boolean allIn(String a,String b){
        for(int i=0; i<a.length(); i++){
            if(b.indexOf(a.charAt(i)) <0)
                return false;
        }
        return true;
    }
}