feat: update solutions to lc problem: No.2788 (doocs#2200)

No.2788.Split Strings by Separator

Author: yanglbme

solution/2700-2799/2788.Split Strings by Separator/README.md

@@ -68,6 +68,12 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：模拟**
+
+我们遍历字符串数组 $words$，对于每个字符串 $w$，我们使用 `separator` 作为分隔符进行拆分，如果拆分后的字符串不为空，则将其加入答案数组。
+
+时间复杂度 $O(n \times m)$，空间复杂度 $O(m)$，其中 $n$ 是字符串数组 $words$ 的长度，而 $m$ 是字符串数组 $words$ 中字符串的最大长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -109,25 +115,17 @@ class Solution {
 public:
     vector<string> splitWordsBySeparator(vector<string>& words, char separator) {
         vector<string> ans;
-        for (auto& w : words) {
-            for (auto& s : split(w, separator)) {
+        for (const auto& w : words) {
+            istringstream ss(w);
+            string s;
+            while (getline(ss, s, separator)) {
                 if (!s.empty()) {
-                    ans.emplace_back(s);
+                    ans.push_back(s);
                 }
             }
         }
         return ans;
     }
-
-    vector<string> split(string& s, char c) {
-        vector<string> res;
-        stringstream ss(s);
-        string t;
-        while (getline(ss, t, c)) {
-            res.push_back(t);
-        }
-        return res;
-    }
 };
 ```
 
@@ -150,15 +148,7 @@ func splitWordsBySeparator(words []string, separator byte) (ans []string) {
 
 ```ts
 function splitWordsBySeparator(words: string[], separator: string): string[] {
-    const ans: string[] = [];
-    for (const w of words) {
-        for (const s of w.split(separator)) {
-            if (s.length > 0) {
-                ans.push(s);
-            }
-        }
-    }
-    return ans;
+    return words.flatMap(w => w.split(separator).filter(s => s.length > 0));
 }
 ```
 

solution/2700-2799/2788.Split Strings by Separator/README_EN.md

@@ -62,6 +62,12 @@ Hence, the resulting array is ["easy","problem"].
 
 ## Solutions
 
+**Solution 1: Simulation**
+
+We traverse the string array $words$. For each string $w$, we use `separator` as the delimiter to split it. If the split string is not empty, we add it to the answer array.
+
+The time complexity is $O(n \times m)$, and the space complexity is $O(m)$, where $n$ is the length of the string array $words$, and $m$ is the maximum length of the strings in the array $words$.
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -99,25 +105,17 @@ class Solution {
 public:
     vector<string> splitWordsBySeparator(vector<string>& words, char separator) {
         vector<string> ans;
-        for (auto& w : words) {
-            for (auto& s : split(w, separator)) {
+        for (const auto& w : words) {
+            istringstream ss(w);
+            string s;
+            while (getline(ss, s, separator)) {
                 if (!s.empty()) {
-                    ans.emplace_back(s);
+                    ans.push_back(s);
                 }
             }
         }
         return ans;
     }
-
-    vector<string> split(string& s, char c) {
-        vector<string> res;
-        stringstream ss(s);
-        string t;
-        while (getline(ss, t, c)) {
-            res.push_back(t);
-        }
-        return res;
-    }
 };
 ```
 
@@ -140,15 +138,7 @@ func splitWordsBySeparator(words []string, separator byte) (ans []string) {
 
 ```ts
 function splitWordsBySeparator(words: string[], separator: string): string[] {
-    const ans: string[] = [];
-    for (const w of words) {
-        for (const s of w.split(separator)) {
-            if (s.length > 0) {
-                ans.push(s);
-            }
-        }
-    }
-    return ans;
+    return words.flatMap(w => w.split(separator).filter(s => s.length > 0));
 }
 ```
 

solution/2700-2799/2788.Split Strings by Separator/Solution.cpp

@@ -2,23 +2,15 @@ class Solution {
 public:
     vector<string> splitWordsBySeparator(vector<string>& words, char separator) {
         vector<string> ans;
-        for (auto& w : words) {
-            for (auto& s : split(w, separator)) {
+        for (const auto& w : words) {
+            istringstream ss(w);
+            string s;
+            while (getline(ss, s, separator)) {
                 if (!s.empty()) {
-                    ans.emplace_back(s);
+                    ans.push_back(s);
                 }
             }
         }
         return ans;
     }
-
-    vector<string> split(string& s, char c) {
-        vector<string> res;
-        stringstream ss(s);
-        string t;
-        while (getline(ss, t, c)) {
-            res.push_back(t);
-        }
-        return res;
-    }
 };

solution/2700-2799/2788.Split Strings by Separator/Solution.ts

@@ -1,11 +1,3 @@
 function splitWordsBySeparator(words: string[], separator: string): string[] {
-    const ans: string[] = [];
-    for (const w of words) {
-        for (const s of w.split(separator)) {
-            if (s.length > 0) {
-                ans.push(s);
-            }
-        }
-    }
-    return ans;
+    return words.flatMap(w => w.split(separator).filter(s => s.length > 0));
 }