'''
[1078] Occurrences After Bigram

https://leetcode.com/problems/occurrences-after-bigram/description/

* algorithms
* Easy (68.00%)
* Source Code:       1078.occurrences-after-bigram.py
* Total Accepted:    6.9K
* Total Submissions: 10.2K
* Testcase Example:  '"alice is a good girl she is a good student"\n"a"\n"good"'

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 <= text.length <= 1000
        text consists of space separated words, where each word consists of lowercase English letters.
        1 <= first.length, second.length <= 10
        first and second consist of lowercase English letters.
'''
class Solution(object):
    def findOcurrences(self, text, first, second):
        """
        :type text: str
        :type first: str
        :type second: str
        :rtype: List[str]
        """
        ret=[]
        index=0
        target=text.split(" ")
        while index < len(target)-2:
            if target[index]==first and target[index+1]==second:
                ret.append(target[index+2])
                index+=2
                continue
            index+=1
        return ret
23ff5baa12ab3175d799aeefdd1d04c9ddc8d355
<mask token>

<mask token>


class Solution(object):
    <mask token>

<mask token>


class Solution(object):

    def findOcurrences(self, text, first, second):
        """
        :type text: str
        :type first: str
        :type second: str
        :rtype: List[str]
        """
        ret = []
        index = 0
        target = text.split(' ')
        while index < len(target) - 2:
            if target[index] == first and target[index + 1] == second:
                ret.append(target[index + 2])
                index += 2
                continue
            index += 1
        return ret

'''
[1078] Occurrences After Bigram

https://leetcode.com/problems/occurrences-after-bigram/description/

* algorithms
* Easy (68.00%)
* Source Code:       1078.occurrences-after-bigram.py
* Total Accepted:    6.9K
* Total Submissions: 10.2K
* Testcase Example:  '"alice is a good girl she is a good student"\n"a"\n"good"'

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 <= text.length <= 1000
        text consists of space separated words, where each word consists of lowercase English letters.
        1 <= first.length, second.length <= 10
        first and second consist of lowercase English letters.
'''
class Solution(object):
    def findOcurrences(self, text, first, second):
        """
        :type text: str
        :type first: str
        :type second: str
        :rtype: List[str]
        """
        ret=[]
        index=0
        target=text.split(" ")
        while index < len(target)-2:
            if target[index]==first and target[index+1]==second:
                ret.append(target[index+2])
                index+=2
                continue
            index+=1
        return ret