LeetCode 2114. Maximum Number of Words Found in Sentences
A sentence is a list of words that are separated by a single space with no leading or trailing spaces.
You are given an array of strings sentences, where each sentences[i]represents a single sentence.
(资料图)
Return the maximum number of words that appear in a single sentence.
Example 1:
Input: sentences = ["alice and bob love leetcode", "i think so too", "this is great thanks very much"]Output: 6Explanation: - The first sentence, "alice and bob love leetcode", has 5 words in total.- The second sentence, "i think so too", has 4 words in total.- The third sentence, "this is great thanks very much", has 6 words in total.Thus, the maximum number of words in a single sentence comes from the third sentence, which has 6 words.
Example 2:
Input: sentences = ["please wait", "continue to fight", "continue to win"]Output: 3Explanation: 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.
Constraints:
1 <= sentences.length <= 100
1 <= sentences[i].length <= 100
sentences[i]consists only of lowercase English letters and ' 'only.
sentences[i]does not have leading or trailing spaces.
All the words in sentences[i]are separated by a single space.
判断数组中哪个字符串含有的单词最多，那么就是如何判断字符串含有多少个单词，我是根据如果这个字符串有多少个空字符+字母的数量，那么单词的数量就是这个数量加1；
之前想用string的 split函数，每次都报错，所以也就不用了。
Runtime2 ms
Beats
98.68%
Memory41.6 MB
Beats
89.3%
相关文章
刚刚，华为官宣：华为Mate60Pro+ 华为MateX5正式开启预订！有这几款配置，速看......
刚刚，华为手机官宣:今天，华为Mate60Pro+、华为MateX5加入先锋计划，
