[leetcode]434. Number of Segments in a String

来源:互联网 发布:云计算 智慧园区 编辑:程序博客网 时间:2024/05/17 13:10

题目链接:https://leetcode.com/problems/number-of-segments-in-a-string/

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

class Solution{public:    int countSegments(string s)    {        int cnt=0;        for(int i=0;i<s.length();i++)        {            if(i==0 && s[i]!=' ')                cnt++;            if(i>0 && s[i-1]==' '&& s[i]!=' ')                cnt++;        }        return cnt;    }};


0 0
原创粉丝点击