feat: add solutions to lc problem: No.1078

No.1078.Occurrences After Bigram

Author: yanglbme

solution/1000-1099/1078.Occurrences After Bigram/README.md

@@ -39,22 +39,76 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+将 text 按空格切分为 words 列表，然后遍历 words，判断是否满足 `words[i] == first && words[i + 1] == second`，若是，则将 `words[i + 2]` 添加至结果列表 ans 中。
+
+最后返回 ans 即可。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def findOcurrences(self, text: str, first: str, second: str) -> List[str]:
+        words = text.split(' ')
+        return [words[i + 2] for i in range(len(words) - 2) if words[i] == first and words[i + 1] == second]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+
+    public String[] findOcurrences(String text, String first, String second) {
+        String[] words = text.split(" ");
+        List<String> ans = new ArrayList<>();
+        for (int i = 0; i < words.length - 2; ++i) {
+            if (first.equals(words[i]) && second.equals(words[i + 1])) {
+                ans.add(words[i + 2]);
+            }
+        }
+        return ans.toArray(new String[0]);
+    }
+}
+
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<string> findOcurrences(string text, string first, string second) {
+        istringstream is(text);
+        vector<string> words;
+        string word;
+        while (is >> word) words.push_back(word);
+        vector<string> ans;
+        for (int i = 0; i < words.size() - 2; ++i)
+            if (words[i] == first && words[i + 1] == second)
+                ans.push_back(words[i + 2]);
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func findOcurrences(text string, first string, second string) []string {
+	words := strings.Split(text, " ")
+	var ans []string
+	for i := 0; i < len(words)-2; i++ {
+		if words[i] == first && words[i+1] == second {
+			ans = append(ans, words[i+2])
+		}
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/1000-1099/1078.Occurrences After Bigram/README_EN.md

@@ -52,13 +52,63 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def findOcurrences(self, text: str, first: str, second: str) -> List[str]:
+        words = text.split(' ')
+        return [words[i + 2] for i in range(len(words) - 2) if words[i] == first and words[i + 1] == second]
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+
+    public String[] findOcurrences(String text, String first, String second) {
+        String[] words = text.split(" ");
+        List<String> ans = new ArrayList<>();
+        for (int i = 0; i < words.length - 2; ++i) {
+            if (first.equals(words[i]) && second.equals(words[i + 1])) {
+                ans.add(words[i + 2]);
+            }
+        }
+        return ans.toArray(new String[0]);
+    }
+}
+
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<string> findOcurrences(string text, string first, string second) {
+        istringstream is(text);
+        vector<string> words;
+        string word;
+        while (is >> word) words.push_back(word);
+        vector<string> ans;
+        for (int i = 0; i < words.size() - 2; ++i)
+            if (words[i] == first && words[i + 1] == second)
+                ans.push_back(words[i + 2]);
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func findOcurrences(text string, first string, second string) []string {
+	words := strings.Split(text, " ")
+	var ans []string
+	for i := 0; i < len(words)-2; i++ {
+		if words[i] == first && words[i+1] == second {
+			ans = append(ans, words[i+2])
+		}
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/1000-1099/1078.Occurrences After Bigram/Solution.cpp

@@ -0,0 +1,14 @@
+class Solution {
+public:
+    vector<string> findOcurrences(string text, string first, string second) {
+        istringstream is(text);
+        vector<string> words;
+        string word;
+        while (is >> word) words.push_back(word);
+        vector<string> ans;
+        for (int i = 0; i < words.size() - 2; ++i)
+            if (words[i] == first && words[i + 1] == second)
+                ans.push_back(words[i + 2]);
+        return ans;
+    }
+};

solution/1000-1099/1078.Occurrences After Bigram/Solution.go

@@ -0,0 +1,10 @@
+func findOcurrences(text string, first string, second string) []string {
+	words := strings.Split(text, " ")
+	var ans []string
+	for i := 0; i < len(words)-2; i++ {
+		if words[i] == first && words[i+1] == second {
+			ans = append(ans, words[i+2])
+		}
+	}
+	return ans
+}

solution/1000-1099/1078.Occurrences After Bigram/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public String[] findOcurrences(String text, String first, String second) {
+        String[] words = text.split(" ");
+        List<String> ans = new ArrayList<>();
+        for (int i = 0; i < words.length - 2; ++i) {
+            if (first.equals(words[i]) && second.equals(words[i + 1])) {
+                ans.add(words[i + 2]);
+            }
+        }
+        return ans.toArray(new String[0]);
+    }
+}

solution/1000-1099/1078.Occurrences After Bigram/Solution.py

@@ -0,0 +1,4 @@
+class Solution:
+    def findOcurrences(self, text: str, first: str, second: str) -> List[str]:
+        words = text.split(' ')
+        return [words[i + 2] for i in range(len(words) - 2) if words[i] == first and words[i + 1] == second]