LeetCode 1078. Occurrences After

2020-11-12  本文已影响0人  LiNGYu_NiverSe

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.

Solution:

    def findOcurrences(self, text: str, first: str, second: str) -> List[str]:
        res = []
        arr = text.split()
        for i in range(len(arr)-2):
            if arr[i] == first and arr[i+1] == second:
                res.append(arr[i+2])
        return res
        

Explanation:

This solution should be quite self-explaining. We split the text into a list of words and then we compare the every first and second words with the first and second given. If they are the same, append the third word to result.

上一篇 下一篇

猜你喜欢

热点阅读