Class Solution
-
- All Implemented Interfaces:
public final class Solution
1078 - Occurrences After Bigram\.
Easy
Given two strings
first
andsecond
, consider occurrences in some text of the form"first second third"
, wheresecond
comes immediately afterfirst
, andthird
comes immediately aftersecond
.Return an array of all the words
third
for each occurrence of"first second third"
.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"
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
andsecond
consist of lowercase English letters.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-