大家好，我是毛毛。ヾ(´∀ ˋ)ﾉ
来到30天的最後一天解题Day啦~

1078. Occurrences After Bigram

Question

Given two strings 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.

Return an array of all the words third for each occurrence of "first second third".

Example

Example1

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

Example2

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

Constraints

• 1 <= text.length <= 1000
• text consists of lowercase English letters and spaces.
• All the words in text a separated by a single space.
• 1 <= first.length, second.length <= 10
• first and second consist of lowercase English letters.

解题

题目

首先先简单的翻译一下题目
给一个字串句子，然後给first跟second两个字串，要找到所有符合条件的third字串，条件就是first下一个要接着second，second下一个要接third。

Think

作法大致上是这样

• 就照着上面的想法，每个index都往下两个index判断是否符合。
• 感觉改成while，让符合条件存入list的时候让index直接跳到下下一个位置的index可能可以再缩短一点执行时间。

Code

Python

class Solution:
    def findOcurrences(self, text: str, first: str, second: str) -> List[str]:
        list_text = text.split(" ")
        ans = []
        
        for index in range(len(list_text)):
            
            if list_text[index] == first:
                if index+1 <= len(list_text)-1 and list_text[index+1] == second:
                    if index+2 <= len(list_text)-1:
                        ans.append(list_text[index+2])
        
        return ans

Result

• Python
  • 

大家下次见