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:
Input: "Hello, my name is John" Output: 5
public class Solution {
public int countSegments(String s) {
if(s.length() == 0) return 0;
int result =0;
if(s.charAt(0)!=' '){
result++;
}
for(int i=0;i<s.length();i++){
if(s.charAt(i)==' '){
if(i != 0 && i != s.length()-1 && s.charAt(i+1)!=' '){
result++;
}
}
}
return result;
}
}
This site Original article All followed" Attribution—NonCommercial—ShareAlike 4.0 (CC BY-NC-SA 4.0) ”。 Please keep the following marks for sharing and interpretation:
Original author: Jake Tao Source: 「LeetCode – 434. Number of Segments in a String」
Post a reply