feat: add solutions to lc problem: No.2942 (#4424)

No.2942.Find Words Containing Character

Author: yanglbme

solution/2900-2999/2942.Find Words Containing Character/README.md

@@ -139,13 +139,19 @@ func findWordsContaining(words []string, x byte) (ans []int) {
 
 ```ts
 function findWordsContaining(words: string[], x: string): number[] {
-    const ans: number[] = [];
-    for (let i = 0; i < words.length; ++i) {
-        if (words[i].includes(x)) {
-            ans.push(i);
-        }
+    return words.flatMap((w, i) => (w.includes(x) ? [i] : []));
+}
+```
+
+#### Rust
+
+```rust
+impl Solution {
+    pub fn find_words_containing(words: Vec<String>, x: char) -> Vec<i32> {
+        words.into_iter().enumerate()
+            .filter_map(|(i, w)| w.contains(x).then(|| i as i32))
+            .collect()
     }
-    return ans;
 }
 ```
 

solution/2900-2999/2942.Find Words Containing Character/README_EN.md

@@ -137,13 +137,19 @@ func findWordsContaining(words []string, x byte) (ans []int) {
 
 ```ts
 function findWordsContaining(words: string[], x: string): number[] {
-    const ans: number[] = [];
-    for (let i = 0; i < words.length; ++i) {
-        if (words[i].includes(x)) {
-            ans.push(i);
-        }
+    return words.flatMap((w, i) => (w.includes(x) ? [i] : []));
+}
+```
+
+#### Rust
+
+```rust
+impl Solution {
+    pub fn find_words_containing(words: Vec<String>, x: char) -> Vec<i32> {
+        words.into_iter().enumerate()
+            .filter_map(|(i, w)| w.contains(x).then(|| i as i32))
+            .collect()
     }
-    return ans;
 }
 ```
 

solution/2900-2999/2942.Find Words Containing Character/Solution.rs

@@ -0,0 +1,9 @@
+impl Solution {
+    pub fn find_words_containing(words: Vec<String>, x: char) -> Vec<i32> {
+        words
+            .into_iter()
+            .enumerate()
+            .filter_map(|(i, w)| w.contains(x).then(|| i as i32))
+            .collect()
+    }
+}

solution/2900-2999/2942.Find Words Containing Character/Solution.ts

@@ -1,9 +1,3 @@
 function findWordsContaining(words: string[], x: string): number[] {
-    const ans: number[] = [];
-    for (let i = 0; i < words.length; ++i) {
-        if (words[i].includes(x)) {
-            ans.push(i);
-        }
-    }
-    return ans;
+    return words.flatMap((w, i) => (w.includes(x) ? [i] : []));
 }