20170223-LeetCode_434_Number of Segments in a String

原创于 2017-02-23 09:49:11 发布 · 310 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #string

Python编程同时被 2 个专栏收录

45 篇文章

订阅专栏

LeetCode

36 篇文章

订阅专栏

本文介绍了一种用于计算字符串中非空格字符连续段落数量的算法，并提供了一个具体的Python实现示例。该算法通过遍历字符串并利用前后字符间是否为空格来判断连续段落，最终返回段落数量。

1.Description

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

2.Solution

#20170223
class Solution(object):
    def countSegments(self, s):
        """
        :type s: str
        :rtype: int
        """
        s,count=s.strip()+' ',0
        for i in range(len(s)-1):
            if s[i]!=' ' and s[i+1]==' ':
                count+=1
        return count