LeetCode-1078-删除最外层括号

/*
 * @lc app=leetcode.cn id=1078 lang=java
 *
 * [1078] 删除最外层的括号
 *
 * https://leetcode-cn.com/problems/occurrences-after-bigram/description/
 *
 * algorithms
 * Easy (62.49%)
 * Total Accepted:    1.5K
 * Total Submissions: 2.4K
 * Testcase Example:  '"alice is a good girl she is a good student"\n"a"\n"good"'
 *
 * 给出第一个词 first 和第二个词 second，考虑在某些文本 text 中可能以 "first second third" 形式出现的情况，其中
 * second 紧随 first 出现，third 紧随 second 出现。
 * 
 * 对于每种这样的情况，将第三个词 "third" 添加到答案中，并返回答案。
 * 
 * 
 * 
 * 示例 1：
 * 
 * 输入：text = "alice is a good girl she is a good student", first = "a", second
 * = "good"
 * 输出：["girl","student"]
 * 
 * 
 * 示例 2：
 * 
 * 输入：text = "we will we will rock you", first = "we", second = "will"
 * 输出：["we","rock"]
 * 
 * 
 * 
 * 
 * 提示：
 * 
 * 
 * 1 <= text.length <= 1000
 * text 由一些用空格分隔的单词组成，每个单词都由小写英文字母组成
 * 1 <= first.length, second.length <= 10
 * first 和 second 由小写英文字母组成
 * 
 * 
 */
class Solution {
    public String[] findOcurrences(String text, String first, String second) {
        List<String> list = new ArrayList();
        String[] texts = text.split(" ");
        for(int i = 0; i < texts.length - 2; i++){
            if(texts[i].equals(first) && texts[i+1].equals(second))
                list.add(texts[i+2]);
        }
        String[] res = new String[list.size()];
        int cnt = 0;
        for(String str : list){
            res[cnt++] = str;
        }
        return res;
    }
}