maximum-number-of-words-found-in-sentences

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

A sentence is a list of words that are separated by a single space&nbsp;with no leading or trailing spaces.

You are given an array of strings <code>sentences</code>, where each <code>sentences[i]</code> represents a single sentence.

Return the maximum number of words that appear in a single sentence.

&nbsp;
Example 1:

<pre>
Input: sentences = [&quot;alice and bob love leetcode&quot;, &quot;i think so too&quot;, &quot;this is great thanks very much&quot;]
Output: 6
Explanation: 
- The first sentence, &quot;alice and bob love leetcode&quot;, has 5 words in total.
- The second sentence, &quot;i think so too&quot;, has 4 words in total.
- The third sentence, &quot;this is great thanks very much&quot;, has 6 words in total.
Thus, the maximum number of words in a single sentence comes from the third sentence, which has 6 words.
</pre>

Example 2:

<pre>
Input: sentences = [&quot;please wait&quot;, &quot;continue to fight&quot;, &quot;continue to win&quot;]
Output: 3
Explanation: It is possible that multiple sentences contain the same number of words. 
In this example, the second and third sentences (underlined) have the same number of words.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= sentences.length &lt;= 100</code></li>
	<li><code>1 &lt;= sentences[i].length &lt;= 100</code></li>
	<li><code>sentences[i]</code> consists only of lowercase English letters and <code>&#39; &#39;</code> only.</li>
	<li><code>sentences[i]</code> does not have leading or trailing spaces.</li>
	<li>All the words in <code>sentences[i]</code> are separated by a single space.</li>
</ul>

mostWordsFound

Maximum Number of Words Found in Sentences

Number of Valid Words in a Sentence

number-of-valid-words-in-a-sentence

句子中的有效单词数

Array

String

一个 句子&nbsp;由一些 单词&nbsp;以及它们之间的单个空格组成，句子的开头和结尾不会有多余空格。

给你一个字符串数组&nbsp;<code>sentences</code>&nbsp;，其中&nbsp;<code>sentences[i]</code>&nbsp;表示单个 句子&nbsp;。

请你返回单个句子里 单词的最多数目&nbsp;。

&nbsp;

示例 1：

<pre>输入：sentences = ["alice and bob love leetcode", "i think so too", "this is great thanks very much"]
输出：6
解释：
- 第一个句子 "alice and bob love leetcode" 总共有 5 个单词。
- 第二个句子 "i think so too" 总共有 4 个单词。
- 第三个句子 "this is great thanks very much" 总共有 6 个单词。
所以，单个句子中有最多单词数的是第三个句子，总共有 6 个单词。
</pre>

示例 2：

<pre>输入：sentences = ["please wait", "continue to fight", "continue to win"]
输出：3
解释：可能有多个句子有相同单词数。
这个例子中，第二个句子和第三个句子（加粗斜体）有相同数目的单词数。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= sentences.length &lt;= 100</code></li>
	<li><code>1 &lt;= sentences[i].length &lt;= 100</code></li>
	<li><code>sentences[i]</code>&nbsp;只包含小写英文字母和&nbsp;<code>' '</code>&nbsp;。</li>
	<li><code>sentences[i]</code>&nbsp;的开头和结尾都没有空格。</li>
	<li><code>sentences[i]</code>&nbsp;中所有单词由单个空格隔开。</li>
</ul>