原題鏈接在這里：https://leetcode.com/problems/keyboard-row/#/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.

題解：

把在同row的char標(biāo)記成同index存在HashMap<Character, Integer> hm中.?

然后判定word中的每一個(gè)char是否有相同的index.

Time Complexity: O(n), n是words中每個(gè)word的char總和.

Space: O(1). hm size, regardless res size.

AC Java:

1 public class Solution { 2 public String[] findWords(String[] words) { 3 if(words == null || words.length == 0){ 4 return words; 5 } 6 7 String [] keyboard = {"qwertyuiop", "asdfghjkl", "zxcvbnm"}; 8 HashMap<Character, Integer> hm = new HashMap<Character, Integer>(); 9 for(int i = 0; i<keyboard.length; i++){ 10 for(char c : keyboard[i].toCharArray()){ 11 hm.put(c, i); 12 } 13 } 14 15 List<String> res = new ArrayList<String>(); 16 for(String word : words){ 17 if(word == null || word.length() == 0){ 18 continue; 19 } 20 int ind = hm.get(word.toLowerCase().charAt(0)); 21 for(char c : word.toLowerCase().toCharArray()){ 22 if(ind != hm.get(c)){ 23 ind = -1; 24 } 25 } 26 if(ind != -1){ 27 res.add(word); 28 } 29 } 30 31 return res.toArray(new String[0]); 32 } 33 }

?

轉(zhuǎn)載于:https://www.cnblogs.com/Dylan-Java-NYC/p/6637828.html

《新程序員》：云原生和全面數(shù)字化實(shí)踐50位技術(shù)專家共同創(chuàng)作，文字、視頻、音頻交互閱讀

總結(jié)

以上是生活随笔為你收集整理的LeetCode Keyboard Row的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。