-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
1023.java
66 lines (62 loc) · 2.12 KB
/
1023.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
__________________________________________________________________________________________________
sample 0 ms submission
class Solution {
public List<Boolean> camelMatch(String[] queries, String pattern) {
List<Boolean> res = new ArrayList<>();
for (String query : queries) {
res.add(match(query, pattern));
}
return res;
}
boolean match(String query, String pattern) {
int queryPoint = 0;
int patternPoint = 0;
while (queryPoint < query.length()
&& patternPoint < pattern.length()) {
while (queryPoint < query.length()
&& query.charAt(queryPoint) !=
pattern.charAt(patternPoint)) {
if (isCapital(query.charAt(queryPoint)))
return false;
queryPoint++;
}
if (queryPoint == query.length()) {
return false;
}
queryPoint++;
patternPoint++;
}
if (patternPoint == pattern.length()) {
while (queryPoint < query.length()) {
if (isCapital(query.charAt(queryPoint)))
return false;
queryPoint++;
}
return true;
}
return false;
}
boolean isCapital(char c) {
return c >='A' && c <= 'Z';
}
}
__________________________________________________________________________________________________
sample 34700 kb submission
class Solution {
public List<Boolean> camelMatch(String[] queries, String pattern) {
return Arrays.stream(queries).map(q -> doesMatchPattern(q, pattern)).collect(Collectors.toList());
}
private boolean doesMatchPattern(String query, String pattern) {
char[] queryArr = query.toCharArray();
int j = 0;
for (int i = 0; i < queryArr.length; i++) {
if (j < pattern.length() && queryArr[i] == pattern.charAt(j)) {
j++;
} else if (Character.isUpperCase(queryArr[i])) {
return false;
}
}
return j == pattern.length();
}
}
__________________________________________________________________________________________________