Leetcode 434. Number of Segments in a String--计算连续非空格子串的个数

二十六画生的博客

于 2019-06-19 15:05:15 发布

阅读量366

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/u010002184/article/details/92831520

笔试面经 LeetCode 剑指Offer 后端/大数据专栏收录该内容

226 篇文章 ¥9.90 ¥99.00

订阅专栏

超级会员免费看

此博客主要讲解如何求解Leetcode 434题，即计算一个字符串中连续非空格字符组成的段的数量。需要注意，字符串不包含任何非打印字符，不能简单地使用split方法来解决。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

Input: "Hello, my name is John"
Output: 5

不是简单的split就行的！！

package com.string;

/**
 * Title:
 *
 * @Author 
 * @CreateTime 2019/6/19 10:09
 */
public class Leetcode_434_NumberofSegmentsinaString {

    /**
     * Runtime: 0 ms, faster than 100.00% of Java online submissions for Number of Segments in a String.
     * Memory Usage: 34.1 MB, less than 99.72% of Java online submissions for Number of Se