LeetCode: Number of Segments in a String

LeetCode: Number of Segments in a String

Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.

Please note that the string does not contain any non-printable characters.

Example:

1
2
Input: "Hello, my name is John"
Output: 5
1
2
3
4
5
6
7
8
public class Solution {
public int countSegments(String s) {
if(s == null || s.trim().isEmpty()){
return 0;
}
return s.trim().split("( )+").length;
}
}