原题网址:https://leetcode.com/problems/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:
Input: "Hello, my name is John" Output: 5
方法:直接扫描。
public class Solution {
public int countSegments(String s) {
int count = 0;
int prev = 0;
for(int i = 0; i <= s.length(); i++) {
if (i == s.length() || s.charAt(i) == ' ') {
if (prev < i) {
count++;
}
prev = i + 1;
}
}
return count;
}
}