-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
500.java
122 lines (99 loc) · 3.16 KB
/
500.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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
__________________________________________________________________________________________________
sample 0 ms submission
class Solution {
private String upperRow = "qwertyuiop";
private String middleRow = "asdfghjkl";
private String lowerRow = "zxcvbnm";
private boolean isMadeFromRow(String s, String row) {
for(int i = 0; i < s.length(); i++) {
if(row.indexOf(s.charAt(i)) == -1) {
return false;
}
}
return true;
}
private boolean isValid(String s)
{
s = s.toLowerCase();
return isMadeFromRow(s, lowerRow) || isMadeFromRow(s, middleRow) || isMadeFromRow(s, upperRow);
}
public String[] findWords(String[] words) {
ArrayList<String> list = new ArrayList<String>();
String[] result;
for(int i = 0; i < words.length; i++) {
if(isValid(words[i])) {
list.add(words[i]);
}
}
result = new String[list.size()];
for(int i = 0; i < list.size(); i++) {
result[i] = list.get(i);
}
return result;
}
}
__________________________________________________________________________________________________
sample 34484 kb submission
class Solution {
public String[] findWords(String[] words) {
List<Set<String>> rowMap = new ArrayList<>();
createRowMap(rowMap);
List<String> result = new ArrayList<>();
//each word
for(String word: words){
//check each keyboard row
for(Set<String> row: rowMap){
if(whetherExistInRow(word, row)){
result.add(word);
break;
}
}
}
return result.stream().toArray(String[]::new);
}
private boolean whetherExistInRow(String word, Set<String> row){
//check characters
for(int i =0; i < word.length(); i++){
String ch = word.substring(i,i+1).toLowerCase();
if(!row.contains(ch)){
return false;
}
}
return true;
}
private void createRowMap(List<Set<String>> rowMap){
Set<String> row1 = new HashSet<>();
row1.add("q");
row1.add("w");
row1.add("e");
row1.add("r");
row1.add("t");
row1.add("y");
row1.add("u");
row1.add("i");
row1.add("o");
row1.add("p");
rowMap.add(row1);
Set<String> row2 = new HashSet<>();
row2.add("a");
row2.add("s");
row2.add("d");
row2.add("f");
row2.add("g");
row2.add("h");
row2.add("j");
row2.add("k");
row2.add("l");
rowMap.add(row2);
Set<String> row3 = new HashSet<>();
row3.add("z");
row3.add("x");
row3.add("c");
row3.add("v");
row3.add("b");
row3.add("n");
row3.add("m");
rowMap.add(row3);
}
}
__________________________________________________________________________________________________