434. Number of Segments in a String

标签：where   ++   示例   pre   nts   rac   注意   cte   char   

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

找出连续字符串个数（注意示例中Hello,后面有空格）
解题思路：
　　设立标志位，遍历字符串，当标志位从0变为1时，count++

 1 int countSegments(char* s) {
 2     int flag=0;
 3     int i=0;
 4     int count=0;
 5     while(s[i])
 6     {
 7         if(!flag&&!(s[i]==‘ ‘||s[i]==‘\t‘))
 8         {
 9             flag=1;
10             count++;
11         }
12         else
13         if(flag&&(s[i]==‘ ‘||s[i]==‘\t‘))
14             flag=0;
15         i++;
16     }
17     return count;
18 }

434. Number of Segments in a String

标签：where   ++   示例   pre   nts   rac   注意   cte   char   

原文地址：http://www.cnblogs.com/fcyworld/p/6147004.html