您的位置 首页 JAVA(2017)

LeetCode – 434. 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) {
        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;
    }
}
看完了?留个评分呗?
[0人评了分,平均: 0/5]

本站原创文章皆遵循“署名-非商业性使用-相同方式共享 3.0 (CC BY-NC-SA 3.0)”。转载请保留以下标注:

原文来源:《LeetCode – 434. Number of Segments in a String》

发表评论

电子邮件地址不会被公开。

返回顶部