Occurrences After Bigram LeetCode solution in Java

1
class Solution {
2
  public String[] findOcurrences(String text, String first, String second) {
3
    String[] st = text.split(" ");
4
    List<String> l = new ArrayList<String>();
5
    int i = 0, n = st.length;
6

7
    while (i < n) {
8
      if (st[i].equals(first)) if (i + 1 < n - 1 && st[i + 1].equals(second)) l.add(st[i + 2]);
9
      i++;
10
    }
11

12
    return l.toArray(new String[0]);
13
  }
14
}