Leetcode 1078：Bigram分词

题目描述

给出第一个词 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 由小写英文字母组成

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/occurrences-after-bigram
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

 

解题思路

class Solution {
public:
    vector<string> findOcurrences(string text, string first, string second) {
        vector<string> ans;
        string::size_type st1 = text.find_first_not_of(" "),st2;
        string fir = "",sec = "";
        while(st1 != string::npos){
            st2 = text.find_first_of(" ",st1);
            if(st2 == string::npos) st2 = text.length();
            string tmp = text.substr(st1,st2-st1);
            if(fir == "") fir = tmp;
            else if(sec == "") sec = tmp;
            else{
                if(fir == first && sec == second) ans.push_back(tmp);
                fir = sec;
                sec = tmp;
            }
            st1 = text.find_first_not_of(" ",st2);
        }
        return ans;
    }
};