-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2114-MaximumNumberOfWordsFoundInSentences.go
More file actions
66 lines (57 loc) · 2.82 KB
/
2114-MaximumNumberOfWordsFoundInSentences.go
File metadata and controls
66 lines (57 loc) · 2.82 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
package main
// 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: 6
// Explanation:
// - 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: 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.
// 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.
import "fmt"
func mostWordsFound(sentences []string) int {
res := 0
getWordCount := func(sentence string) int {
count := 0
for _, v := range sentence { // 统计 ' ' 数
if v == ' ' { count++ }
}
return count + 1
}
for _, v := range sentences {
n := getWordCount(v)
if n > res { res = n }
}
return res
}
func main() {
// Example 1:
// Input: sentences = ["alice and bob love leetcode", "i think so too", "this is great thanks very much"]
// Output: 6
// Explanation:
// - 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.
fmt.Println(mostWordsFound([]string{"alice and bob love leetcode", "i think so too", "this is great thanks very much"})) // 6
// Example 2:
// Input: sentences = ["please wait", "continue to fight", "continue to win"]
// 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.
fmt.Println(mostWordsFound([]string{"please wait", "continue to fight", "continue to win"})) // 3
}