您的位置:首页 > 其它

LeetCode 434. Number of Segments in a String

2016-12-23 14:42 351 查看
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) {
s=" "+s+" ";
int count=0;
for(int i=0;i<s.size()-1;i++){
if(s[i]==' '&&s[i+1]!=' ')count++;
}
return count;
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  leetcode