LeetCode-434. Number of Segments in a String

问题：https://leetcode.com/problems/number-of-segments-in-a-string/?tab=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
分析：遍历字符串。遇到空格跳出，遇到一个字符，统计值加1，然后用while循环找接下来空字符的位置。这样记录了完成了一个单词。
C++代码：

class Solution {public:    int countSegments(string s) {        int l=s.length();        int res=0;        for(int i=0;i<l;i++){            if(s[i]==' ') continue;            res++;            while(i<l && s[i]!=' ') ++i;        }        return res;    }};