leetcode 1078 Occurrences After Bigram

lc1078 Occurrences After Bigram

trim().split()将原字符串转换成words数组

依次匹配first和second，若两者都能匹配上，则下一个单词为third，将其加入List<String> res

返回 res.toArray(new String[0])

class Solution {
    public String[] findOcurrences(String text, String first, String second) {
        String[] textPlus = text.trim().split(" ");
        List<String> res = new ArrayList();
        
        if(textPlus.length < 3 || first.length() == 0 || second.length() == 0)
            return new String[0];
        
        for(int i=0; i<textPlus.length-2; i++){
            if(textPlus[i].equals(first) && textPlus[i+1].equals(second)){
                res.add(textPlus[i+2]);
            }
        }
        
        return res.toArray(new String[0]);
    }
}