1078. Occurrences After Bigram，有split函数的语言会更好

Given words first and second, consider occurrences in some text of the form "first second third", where second comes immediately after first, and third comes immediately after second.

For each such occurrence, add "third" to the answer, and return the answer.

 

Example 1:

Input: text = "alice is a good girl she is a good student", first = "a", second = "good"
Output: ["girl","student"]

Example 2:

Input: text = "we will we will rock you", first = "we", second = "will"
Output: ["we","rock"]

 

Note:

1. 1 <= text.length <= 1000
2. text consists of space separated words, where each word consists of lowercase English letters.
3. 1 <= first.length, second.length <= 10
4. first and second consist of lowercase English letters.

这个题目虽然easy级别，但是一开始想通过字符串find的方式来做，先find字符串first+”　“＋second，然后就是third，但是处理起来很烦躁，有各种意外，包括如果first = a, 有testcase "aa good girl"。

所以，算了，重写了，先按空格分隔，然在逐个扫描，这样也可以避免"we will we will rock you"这个case带来的坑。

class Solution {
public:
    vector<string> findOcurrences(string text, string first, string second) {
        vector<string> res;
        vector<string> result;
        while(text.size() != 0)
        {
            int pos = text.find_first_of(" ", 0);
            if(pos == string::npos)
            {
                string sub = text.substr(0);
                res.push_back(sub);
                break;
            }
            string sub = text.substr(0, pos);
            res.push_back(sub);
            text = text.substr(pos + 1);
        }
        for(int i = 0; i < res.size() - 2; i++)
        {
            if(res[i] == first)
            {
                if(res[i + 1] == second)
                    result.push_back(res[i+2]);
            }
        }
        return result;
    }
};

运行结果，不错哈？

Runtime: 0 ms, faster than 100.00% of C++ online submissions forOccurrences After Bigram.

Memory Usage: 6.8 MB, less than 100.00% of C++ online submissions forOccurrences After Bigram.