-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
1078.java
85 lines (77 loc) · 2.6 KB
/
1078.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
__________________________________________________________________________________________________
sample 0 ms submission
class Solution {
private static boolean match(final String src, final int start, final int end, final String target) {
final int len = target.length();
if ((end-start) != (len-1))
return false;
for (int i = 0; i < len; ++i)
if (src.charAt(start+i) != target.charAt(i))
return false;
return true;
}
public String[] findOcurrences(String text, String first, String second) {
final int len = text.length();
int i = 0;
char ch = 0;
boolean match1 = false, match2 = false;
final List<String> results = new ArrayList<>();
while (i < len) {
while ((i < len) && (ch = text.charAt(i)) == ' ')
++i;
final int start = i;
if (i >= len)
break;
while ((i < len) && (ch = text.charAt(i)) != ' ')
++i;
final int end = i-1;
if (match2) {
results.add(text.substring(start, end+1));
match1 = match(text, start, end, first);
match2 = false;
} else if (match1 && match(text, start, end, second)) {
match2 = true;
} else {
match1 = match(text, start, end, first);
}
}
final String[] r = new String[results.size()];
for (i = 0; i < r.length; ++i)
r[i] = results.get(i);
return r;
}
}
__________________________________________________________________________________________________
sample 1 ms submission
class Solution {
public String[] findOcurrences(String text, String first, String second) {
ArrayList<String> answer = new ArrayList<>();
String[] words = text.split(" ");
for(int i = 2; i<words.length; i++){
if(first.equals(words[i-2]) && second.equals(words[i-1])){
answer.add(words[i]);
}
}
return answer.toArray(new String[0]);
}
}
__________________________________________________________________________________________________
sample 2 ms submission
class Solution {
public String[] findOcurrences(String text, String first, String second) {
String merge = first + " " + second;
String result[] = text.split(merge);
String finalList[] = new String[result.length - 1];
int j = 0;
for (int i = 1; i <= result.length - 1; i++) {
if (result[i].equalsIgnoreCase(" ")) {
finalList[j] = first;
j++;
continue;
}
finalList[j] = result[i].split(" ")[1];
j++;
}
return finalList;
}
}