feat: add solutions to lc problem: No.1408

No.1408.String Matching in an Array

Author: YangFong

solution/1400-1499/1408.String Matching in an Array/README.md

@@ -131,6 +131,42 @@ func stringMatching(words []string) []string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function stringMatching(words: string[]): string[] {
+    const res: string[] = [];
+    for (const target of words) {
+        for (const word of words) {
+            if (word !== target && word.includes(target)) {
+                res.push(target);
+                break;
+            }
+        }
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn string_matching(words: Vec<String>) -> Vec<String> {
+        let mut res = Vec::new();
+        for target in words.iter() {
+            for word in words.iter() {
+                if word != target && word.contains(target) {
+                    res.push(target.clone());
+                    break;
+                }
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1400-1499/1408.String Matching in an Array/README_EN.md

@@ -122,6 +122,42 @@ func stringMatching(words []string) []string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function stringMatching(words: string[]): string[] {
+    const res: string[] = [];
+    for (const target of words) {
+        for (const word of words) {
+            if (word !== target && word.includes(target)) {
+                res.push(target);
+                break;
+            }
+        }
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn string_matching(words: Vec<String>) -> Vec<String> {
+        let mut res = Vec::new();
+        for target in words.iter() {
+            for word in words.iter() {
+                if word != target && word.contains(target) {
+                    res.push(target.clone());
+                    break;
+                }
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1400-1499/1408.String Matching in an Array/Solution.rs

@@ -0,0 +1,14 @@
+impl Solution {
+    pub fn string_matching(words: Vec<String>) -> Vec<String> {
+        let mut res = Vec::new();
+        for target in words.iter() {
+            for word in words.iter() {
+                if word != target && word.contains(target) {
+                    res.push(target.clone());
+                    break;
+                }
+            }
+        }
+        res
+    }
+}

solution/1400-1499/1408.String Matching in an Array/Solution.ts

@@ -0,0 +1,12 @@
+function stringMatching(words: string[]): string[] {
+    const res: string[] = [];
+    for (const target of words) {
+        for (const word of words) {
+            if (word !== target && word.includes(target)) {
+                res.push(target);
+                break;
+            }
+        }
+    }
+    return res;
+}