首页 > itarticle > [leetcode] problem 434 – number of segments in a string

[leetcode] problem 434 – number of segments in a string

admin 11月 13, 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-printable characters.

Example

Input: “Hello, my name is John”

Output: 5

Code

public int (String s) {
    int result = 0;

    for (int i = 0; i < s.length(); i++) {
        if (s.charAt(i) != ' ' && (i == 0 || s.charAt(i - 1) == ' '))
            result++;
    }

    return result;
}