feat: add solutions to lc problem: No.1408

No.1408.String Matching in an Array
yas8say · Aug 5, 2022 · 3558f4e · 3558f4e
1 parent 4f3afc1
commit 3558f4e
Show file tree

Hide file tree

Showing 6 changed files with 185 additions and 2 deletions.
diff --git a/solution/1400-1499/1408.String Matching in an Array/README.md b/solution/1400-1499/1408.String Matching in an Array/README.md
@@ -48,22 +48,87 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：暴力枚举**
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def stringMatching(self, words: List[str]) -> List[str]:
+        ans = []
+        for i, w1 in enumerate(words):
+            for j, w2 in enumerate(words):
+                if i != j and w1 in w2:
+                    ans.append(w1)
+                    break
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public List<String> stringMatching(String[] words) {
+        List<String> ans = new ArrayList<>();
+        int n = words.length;
+        for (int i = 0; i < n; ++i) {
+            for (int j = 0; j < n; ++j) {
+                if (i != j && words[j].contains(words[i])) {
+                    ans.add(words[i]);
+                    break;
+                }
+            }
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<string> stringMatching(vector<string>& words) {
+        vector<string> ans;
+        int n = words.size();
+        for (int i = 0; i < n; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                if (i != j && words[j].find(words[i]) != string::npos)
+                {
+                    ans.push_back(words[i]);
+                    break;
+                }
+            }
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func stringMatching(words []string) []string {
+	ans := []string{}
+	for i, w1 := range words {
+		for j, w2 := range words {
+			if i != j && strings.Contains(w2, w1) {
+				ans = append(ans, w1)
+				break
+			}
+		}
+	}
+	return ans
+}
 ```
 
 ### **...**

diff --git a/solution/1400-1499/1408.String Matching in an Array/README_EN.md b/solution/1400-1499/1408.String Matching in an Array/README_EN.md
@@ -50,13 +50,76 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def stringMatching(self, words: List[str]) -> List[str]:
+        ans = []
+        for i, w1 in enumerate(words):
+            for j, w2 in enumerate(words):
+                if i != j and w1 in w2:
+                    ans.append(w1)
+                    break
+        return ans
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public List<String> stringMatching(String[] words) {
+        List<String> ans = new ArrayList<>();
+        int n = words.length;
+        for (int i = 0; i < n; ++i) {
+            for (int j = 0; j < n; ++j) {
+                if (i != j && words[j].contains(words[i])) {
+                    ans.add(words[i]);
+                    break;
+                }
+            }
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<string> stringMatching(vector<string>& words) {
+        vector<string> ans;
+        int n = words.size();
+        for (int i = 0; i < n; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                if (i != j && words[j].find(words[i]) != string::npos)
+                {
+                    ans.push_back(words[i]);
+                    break;
+                }
+            }
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func stringMatching(words []string) []string {
+	ans := []string{}
+	for i, w1 := range words {
+		for j, w2 := range words {
+			if i != j && strings.Contains(w2, w1) {
+				ans = append(ans, w1)
+				break
+			}
+		}
+	}
+	return ans
+}
 ```
 
 ### **...**

diff --git a/solution/1400-1499/1408.String Matching in an Array/Solution.cpp b/solution/1400-1499/1408.String Matching in an Array/Solution.cpp
@@ -0,0 +1,19 @@
+class Solution {
+public:
+    vector<string> stringMatching(vector<string>& words) {
+        vector<string> ans;
+        int n = words.size();
+        for (int i = 0; i < n; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                if (i != j && words[j].find(words[i]) != string::npos)
+                {
+                    ans.push_back(words[i]);
+                    break;
+                }
+            }
+        }
+        return ans;
+    }
+};
diff --git a/solution/1400-1499/1408.String Matching in an Array/Solution.go b/solution/1400-1499/1408.String Matching in an Array/Solution.go
@@ -0,0 +1,12 @@
+func stringMatching(words []string) []string {
+	ans := []string{}
+	for i, w1 := range words {
+		for j, w2 := range words {
+			if i != j && strings.Contains(w2, w1) {
+				ans = append(ans, w1)
+				break
+			}
+		}
+	}
+	return ans
+}
diff --git a/solution/1400-1499/1408.String Matching in an Array/Solution.java b/solution/1400-1499/1408.String Matching in an Array/Solution.java
@@ -0,0 +1,15 @@
+class Solution {
+    public List<String> stringMatching(String[] words) {
+        List<String> ans = new ArrayList<>();
+        int n = words.length;
+        for (int i = 0; i < n; ++i) {
+            for (int j = 0; j < n; ++j) {
+                if (i != j && words[j].contains(words[i])) {
+                    ans.add(words[i]);
+                    break;
+                }
+            }
+        }
+        return ans;
+    }
+}
diff --git a/solution/1400-1499/1408.String Matching in an Array/Solution.py b/solution/1400-1499/1408.String Matching in an Array/Solution.py
@@ -0,0 +1,9 @@
+class Solution:
+    def stringMatching(self, words: List[str]) -> List[str]:
+        ans = []
+        for i, w1 in enumerate(words):
+            for j, w2 in enumerate(words):
+                if i != j and w1 in w2:
+                    ans.append(w1)
+                    break
+        return ans