-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram37.java
More file actions
70 lines (47 loc) · 2.04 KB
/
program37.java
File metadata and controls
70 lines (47 loc) · 2.04 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
67
68
69
70
/*
2114. Maximum Number of Words Found in Sentences
Easy
1.4K
42
Companies
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.
*/
package LeetCode;
public class program37 {
static int mostWordsFound(String[] sentences) {
int sumword=0;
int max=0;
for(int i=0;i<sentences.length;i++){
String word = sentences[i];
sumword =0;
for(int j=0;j<word.length();j++){
if(word.charAt(j)==' '){
sumword++;
}
}
if(sumword+1 > max){
max = sumword+1;
}
}
return max;
}
public static void main(String[] args) {
String sentences[] ={"please wait", "continue to fight", "continue to win"};
System.out.println(mostWordsFound(sentences));
}
}