LeetCode 434. 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) {
if(!s.size()) return 0;
bool start = false;
int count =0;
int i;
char tmp;
for(i = 0; i < s.size(); i ++){
if(s[i] == ' '){
if(start){
start = false;
count ++;
}
}else{
start = true;
}
}
if(start) count ++;
return count;
}
};