leetcode-434-easy

Number of Segments in a String

Given a string s, return the number of segments in the string.

A segment is defined to be a contiguous sequence of non-space characters.

Example 1:

Input: s = "Hello, my name is John"
Output: 5
Explanation: The five segments are ["Hello,", "my", "name", "is", "John"]
Example 2:

Input: s = "Hello"
Output: 1
Constraints:

0 <= s.length <= 300
s consists of lowercase and uppercase English letters, digits, or one of the following characters "!@#$%^&*()_+-=',.:".
The only space character in s is ' '.

思路一:刚开始的想法是统计空格数量,测试发现不行。最后用最简单的算法,先分割字符,最后统计合法的单词数量

    public int countSegments(String s) {
        int count = 0;
        String[] arr = s.split("\\s");
        for (String word : arr) {
            if (word.trim().length() > 0) {
                count++;
            }
        }
        return count;
    }
posted @ 2023-01-08 19:42  iyiluo  阅读(29)  评论(0)    收藏  举报