feat: add solutions to lc problem: No.2114

No.2114.Maximum Number of Words Found in Sentences

Author: yanglbme

solution/2100-2199/2114.Maximum Number of Words Found in Sentences/README.md

@@ -49,7 +49,11 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-返回最大空格数量再加 1 即可。
+**方法一：空格计数**
+
+我们遍历数组 `sentences`，对于每个句子，我们计算其中的空格数，那么单词数就是空格数加 $1$。最后返回最大的单词数即可。
+
+时间复杂度 $O(L)$，空间复杂度 $O(1)$。其中 $L$ 是数组 `sentences` 中所有字符串的长度之和。
 
 <!-- tabs:start -->
 
@@ -69,23 +73,18 @@ class Solution:
 
 ```java
 class Solution {
-
     public int mostWordsFound(String[] sentences) {
         int ans = 0;
-        for (String s : sentences) {
-            ans = Math.max(ans, 1 + count(s, ' '));
-        }
-        return ans;
-    }
-
-    private int count(String s, char c) {
-        int cnt = 0;
-        for (char ch : s.toCharArray()) {
-            if (ch == c) {
-                ++cnt;
+        for (var s : sentences) {
+            int cnt = 1;
+            for (int i = 0; i < s.length(); ++i) {
+                if (s.charAt(i) == ' ') {
+                    ++cnt;
+                }
             }
+            ans = Math.max(ans, cnt);
         }
-        return cnt;
+        return ans;
     }
 }
 ```
@@ -97,46 +96,26 @@ class Solution {
 public:
     int mostWordsFound(vector<string>& sentences) {
         int ans = 0;
-        for (string& s : sentences)
-            ans = max(ans, 1 + count(s, ' '));
+        for (auto& s : sentences) {
+            int cnt = 1 + count(s.begin(), s.end(), ' ');
+            ans = max(ans, cnt);
+        }
         return ans;
     }
-
-    int count(string s, char c) {
-        int cnt = 0;
-        for (char& ch : s)
-            if (ch == c)
-                ++cnt;
-        return cnt;
-    }
 };
 ```
 
 ### **Go**
 
 ```go
-func mostWordsFound(sentences []string) int {
-	count := func(s string, c rune) int {
-		cnt := 0
-		for _, ch := range s {
-			if ch == c {
-				cnt++
-			}
-		}
-		return cnt
-	}
-	ans := 0
+func mostWordsFound(sentences []string) (ans int) {
 	for _, s := range sentences {
-		ans = max(ans, 1+count(s, ' '))
-	}
-	return ans
-}
-
-func max(a, b int) int {
-	if a > b {
-		return a
+		cnt := 1 + strings.Count(s, " ")
+		if ans < cnt {
+			ans = cnt
+		}
 	}
-	return b
+	return
 }
 ```
 

solution/2100-2199/2114.Maximum Number of Words Found in Sentences/README_EN.md

@@ -59,23 +59,18 @@ class Solution:
 
 ```java
 class Solution {
-
     public int mostWordsFound(String[] sentences) {
         int ans = 0;
-        for (String s : sentences) {
-            ans = Math.max(ans, 1 + count(s, ' '));
-        }
-        return ans;
-    }
-
-    private int count(String s, char c) {
-        int cnt = 0;
-        for (char ch : s.toCharArray()) {
-            if (ch == c) {
-                ++cnt;
+        for (var s : sentences) {
+            int cnt = 1;
+            for (int i = 0; i < s.length(); ++i) {
+                if (s.charAt(i) == ' ') {
+                    ++cnt;
+                }
             }
+            ans = Math.max(ans, cnt);
         }
-        return cnt;
+        return ans;
     }
 }
 ```
@@ -87,46 +82,26 @@ class Solution {
 public:
     int mostWordsFound(vector<string>& sentences) {
         int ans = 0;
-        for (string& s : sentences)
-            ans = max(ans, 1 + count(s, ' '));
+        for (auto& s : sentences) {
+            int cnt = 1 + count(s.begin(), s.end(), ' ');
+            ans = max(ans, cnt);
+        }
         return ans;
     }
-
-    int count(string s, char c) {
-        int cnt = 0;
-        for (char& ch : s)
-            if (ch == c)
-                ++cnt;
-        return cnt;
-    }
 };
 ```
 
 ### **Go**
 
 ```go
-func mostWordsFound(sentences []string) int {
-	count := func(s string, c rune) int {
-		cnt := 0
-		for _, ch := range s {
-			if ch == c {
-				cnt++
-			}
-		}
-		return cnt
-	}
-	ans := 0
+func mostWordsFound(sentences []string) (ans int) {
 	for _, s := range sentences {
-		ans = max(ans, 1+count(s, ' '))
-	}
-	return ans
-}
-
-func max(a, b int) int {
-	if a > b {
-		return a
+		cnt := 1 + strings.Count(s, " ")
+		if ans < cnt {
+			ans = cnt
+		}
 	}
-	return b
+	return
 }
 ```
 

solution/2100-2199/2114.Maximum Number of Words Found in Sentences/Solution.cpp

@@ -2,16 +2,10 @@ class Solution {
 public:
     int mostWordsFound(vector<string>& sentences) {
         int ans = 0;
-        for (string& s : sentences)
-            ans = max(ans, 1 + count(s, ' '));
+        for (auto& s : sentences) {
+            int cnt = 1 + count(s.begin(), s.end(), ' ');
+            ans = max(ans, cnt);
+        }
         return ans;
     }
-
-    int count(string s, char c) {
-        int cnt = 0;
-        for (char& ch : s)
-            if (ch == c)
-                ++cnt;
-        return cnt;
-    }
 };

solution/2100-2199/2114.Maximum Number of Words Found in Sentences/Solution.go

@@ -1,23 +1,9 @@
-func mostWordsFound(sentences []string) int {
-	count := func(s string, c rune) int {
-		cnt := 0
-		for _, ch := range s {
-			if ch == c {
-				cnt++
-			}
-		}
-		return cnt
-	}
-	ans := 0
+func mostWordsFound(sentences []string) (ans int) {
 	for _, s := range sentences {
-		ans = max(ans, 1+count(s, ' '))
-	}
-	return ans
-}
-
-func max(a, b int) int {
-	if a > b {
-		return a
+		cnt := 1 + strings.Count(s, " ")
+		if ans < cnt {
+			ans = cnt
+		}
 	}
-	return b
+	return
 }

solution/2100-2199/2114.Maximum Number of Words Found in Sentences/Solution.java

@@ -1,19 +1,15 @@
 class Solution {
     public int mostWordsFound(String[] sentences) {
         int ans = 0;
-        for (String s : sentences) {
-            ans = Math.max(ans, 1 + count(s, ' '));
-        }
-        return ans;
-    }
-
-    private int count(String s, char c) {
-        int cnt = 0;
-        for (char ch : s.toCharArray()) {
-            if (ch == c) {
-                ++cnt;
+        for (var s : sentences) {
+            int cnt = 1;
+            for (int i = 0; i < s.length(); ++i) {
+                if (s.charAt(i) == ' ') {
+                    ++cnt;
+                }
             }
+            ans = Math.max(ans, cnt);
         }
-        return cnt;
+        return ans;
     }
 }

solution/2100-2199/2117.Abbreviating the Product of a Range/README.md

@@ -12,7 +12,6 @@
 
 <ol>
 	<li>统计乘积中&nbsp;<strong>后缀</strong> 0 的数目，并 <strong>移除</strong> 这些 0 ，将这个数目记为&nbsp;<code>C</code>&nbsp;。
-
     <ul>
     	<li>比方说，<code>1000</code>&nbsp;中有 <code>3</code> 个后缀 0&nbsp;，<code>546</code>&nbsp;中没有后缀 0 。</li>
     </ul>
@@ -27,7 +26,6 @@
     	<li>比方说，<code>12345678987600000</code>&nbsp;被表示为&nbsp;<code>"12345...89876e5"</code>&nbsp;。</li>
     </ul>
     </li>
-
 </ol>
 
 <p>请你返回一个字符串，表示 <strong>闭区间</strong>&nbsp;<code>[left, right]</code>&nbsp;中所有整数&nbsp;<strong>乘积</strong>&nbsp;的&nbsp;<strong>缩写</strong>&nbsp;。</p>

solution/2100-2199/2117.Abbreviating the Product of a Range/README_EN.md

@@ -10,7 +10,6 @@
 
 <ol>
 	<li>Count all <strong>trailing</strong> zeros in the product and <strong>remove</strong> them. Let us denote this count as <code>C</code>.
-
     <ul>
     	<li>For example, there are <code>3</code> trailing zeros in <code>1000</code>, and there are <code>0</code> trailing zeros in <code>546</code>.</li>
     </ul>
@@ -25,7 +24,6 @@
     	<li>For example, <code>12345678987600000</code> will be represented as <code>&quot;12345...89876e5&quot;</code>.</li>
     </ul>
     </li>
-
 </ol>
 
 <p>Return <em>a string denoting the <strong>abbreviated product</strong> of all integers in the <strong>inclusive</strong> range</em> <code>[left, right]</code>.</p>