500. Keyboard Row

最新推荐文章于 2019-09-24 10:27:26 发布

OovEver

最新推荐文章于 2019-09-24 10:27:26 发布

阅读量469

点赞数

分类专栏： LeetCode 文章标签： leetcode-java hashtable

本文链接：https://blog.csdn.net/mupengfei6688/article/details/79033479

版权

LeetCode 专栏收录该内容

137 篇文章 0 订阅

订阅专栏

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.

Example 1:

Input: ["Hello", "Alaska", "Dad", "Peace"]
Output: ["Alaska", "Dad"]

题目大意：给定一个数组，找出数组中所有字符都在一行的字符串

代码

package HashTable;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;

/**
* @author OovEver
* 2018/1/11 13:48
*/
public class LeetCode500 {
  public String[] findWords(String[] words) {
      if(words == null || words.length == 0) return new String[0];
      HashSet<Character>[] keyboard = new HashSet[3];
      keyboard[0] = new HashSet<Character>(Arrays.asList('q','w','e','r','t','y','u','i','o','p','Q','W','E','R','T','Y','U','I','O','P'));
      keyboard[1] = new HashSet<Character>(Arrays.asList('a','s','d','f','g','h','j','k','l','A','S','D','F','G','H','J','K','L'));
      keyboard[2] = new HashSet<Character>(Arrays.asList('z','x','c','v','b','n','m','Z','X','C','V','B','N','M'));
      List<String> res = new ArrayList<>();
      int idx = -1;
      for (String w : words) {
          for(int i=0;i<3;i++) {
              if (keyboard[i].contains(w.charAt(0))) {
                  idx = i;
                  break;
              }
          }
          int i=1;
          for(;i<w.length();i++) {
              if (!keyboard[idx].contains(w.charAt(i))) {
                  break;
              }
          }
          if (i == w.length()) {
              res.add(w);
          }
      }
      String[] result = new String[res.size()];
      for(int i=0;i<result.length;i++) {
          result[i] = res.get(i);
      }
      return result;
  }
}