-
Notifications
You must be signed in to change notification settings - Fork 0
/
keyboardRow.java
34 lines (30 loc) · 939 Bytes
/
keyboardRow.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
class Solution {
public String[] findWords(String[] words) {
String row1 = "qwertyuiop";
String row2 = "asdfghjkl";
String row3 = "zxcvbnm";
List<String> list = new LinkedList<>();
for(String word : words){
int[] row = new int[3];
for(char ch : word.toLowerCase().toCharArray()){
if(row1.indexOf(ch)!= -1){
row[0] = 1;
}else if(row2.indexOf(ch)!= -1){
row[1] = 1;
}else if(row3.indexOf(ch)!= -1){
row[2] = 1;
}
}
int sum = row[0] + row[1] + row[2];
if(sum == 1){
list.add(word);
}
}
String[] strArray = new String[list.size()];
int i = 0;
for(String word : list){
strArray[i++] = word;
}
return strArray;
}
}