leetcode1078. Bigram 分词
简单题

代码如下
js

var findOcurrences = function(text, first, second) {
    const arr = text.split(' '), res = [];
    for (let i = 0; i < arr.length-2; i++) {
        if (arr[i] === first && arr[i+1] === second) res.push(arr[i+2]);
    }
    return res;
};