public class Solution {
public String[] findWords(String[] words) {
if(words == null || words.length == 0){
return new String[0];
}
Map<Character, Integer> map = new HashMap<>();
String[] keyboard = {"qwertyuiop", "asdfghjkl", "zxcvbnm"};
for(int i = 0; i < keyboard.length; i++){
char[] cArr = keyboard[i].toCharArray();
for(char c : cArr){
map.put(c, i);
}
}
List<String> list = new ArrayList<>();
for(int i = 0; i < words.length; i++){
int temp = 0;
boolean flag = true;
char[] cArr = words[i].toLowerCase().toCharArray();
for(int j = 0; j < cArr.length; j++){
if(j == 0){
temp = map.get(cArr[j]);
}
else{
if(temp != map.get(cArr[j])){
flag = false;
break;
}
}
}
if(flag){
list.add(words[i]);
}
}
return list.toArray(new String[list.size()]);
}
}
[LeetCode] 500. Keyboard Row
最新推荐文章于 2022-05-02 21:00:41 发布