forked from anishLearnsToCode/leetcode-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
OccurrencesAfterBigram.java
33 lines (30 loc) · 1.41 KB
/
OccurrencesAfterBigram.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
import java.util.ArrayList;
import java.util.List;
public class OccurrencesAfterBigram {
public String[] findOcurrences(String text, String first, String second) {
List<String> result = new ArrayList<>();
for (int fromIndex = 0 ; fromIndex < text.length() ; fromIndex += first.length() + 1) {
fromIndex = text.indexOf(first, fromIndex);
if (fromIndex == -1) break;
if (areEqual(text, fromIndex + first.length() + 1, second)
&& fromIndex + first.length() + second.length() + 2 < text.length()) {
result.add(nextWord(text, fromIndex + first.length() + second.length() + 2));
}
}
return result.toArray(new String[0]);
}
private boolean areEqual(String text, int fromIndex, String pattern) {
if (pattern.length() > text.length() - fromIndex) return false;
for (int index = fromIndex ; index < text.length() && index - fromIndex < pattern.length() ; index++) {
if (text.charAt(index) != pattern.charAt(index - fromIndex)) return false;
}
return true;
}
private String nextWord(String text, int startIndex) {
StringBuilder result = new StringBuilder();
for (int index = startIndex ; index < text.length() && text.charAt(index) != ' ' ; index++) {
result.append(text.charAt(index));
}
return result.toString();
}
}