链接:https://leetcode-cn.com/problems/occurrences-after-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 由小写英文字母组成
class Solution {
public:
vector<string> findOcurrences(string text, string first, string second) {
vector<string> newText;
vector<string> ans;
int len = text.size();
string temp = "";
for(int i = 0; i <= len; i++)
{
if(text[i] != ' ' && text[i] != '\0') temp.push_back(text[i]);
else
{
newText.push_back(temp);
temp = "";
}
}
int len2 = newText.size();
for(int i = 0; i < len2 - 2; i++)
{
if(newText[i] == first && newText[i + 1] == second) ans.push_back(newText[i + 2]);
}
return ans;
}
};
根据空格将字符串中的单词分别存到newText中,再遍历newText进行判断,注意判断完倒数第三个单词后即可停止。
string往尾部添加元素用str.push_back()