【Leetcode 434. Number of Segments in a String】

水林夕smile

于 2016-12-16 10:41:44 发布

阅读量360

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode 文章标签： leetcode string

本文链接：https://blog.youkuaiyun.com/u012404928/article/details/53690175

Leetcode 专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一个简单的Java程序，用于计算给定字符串中的非空格字符段数量。通过使用split方法和循环遍历来实现，适用于处理包含多个空格分隔的字符串。

434. Number of Segments in a String

Total Accepted: 3749
Total Submissions: 9646
Difficulty: Easy
Contributors: love_FDU_llp

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

java解决方法：

package Test;

public class NumberSegments {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        NumberSegments test=new NumberSegments();
        test.countSegments(", , , ,        a, eaefa");
    }

    public int countSegments(String s) {
        if("".equals(s)){
            return 0;
        }
        int count=0;
        String [] aStrings=s.split(" ");
        for(int i=0;i<aStrings.length;i++){
            if(!"".equals(aStrings[i])){
                count++;
            }
        }
        System.out.println(count);
        return count;
    }
}