您的位置:首页 > 其它

LeetCode 434. Number of Segments in a String

2016-12-20 03:42 381 查看
原题网址: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;
}
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  leetcode