首页 > 代码库 > 434. Number of Segments in a String
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
找出连续字符串个数(注意示例中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
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。