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"]
思路
- 使用split将字符串切分
- 挨个比较first, second即可
代码
class Solution:
def findOcurrences(self, text: str, first: str, second: str) -> List[str]:
spices, res = text.split(), []
for i in range(len(spices) - 2):
if spices[i] == first and spices[i + 1] == second:
res.append(spices[i + 2])
return res