首页 > itarticle > leetcode 434 number of segments in a string

leetcode 434 number of segments in a string

admin 11月 14, 2020 0

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-printablecharacters.

Example:

1
2
 
Input: "Hello, my name is John"
Output: 5
 
1
2
3
4
5
6
7
8
9
10
11
 
class  {
    public int countSegments(String s) {
        int count = 0;
        for (int i=0; i<s.length(); i++) {
            if (s.charAt(i) != ' ' && (i==0 || s.charAt(i-1)==' ')) {
                count ++;
            }
        }
        return count;
    }
}

微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能