首页 > 学院 > 开发设计 > 正文

LEETCODE--Number of Segments in a String

2019-11-08 01:53:52
字体:
来源:转载
供稿:网友

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) { int count = 0; for(int i = 0; i < s.length(); i++){ int flag = 0; while(s[i] != ' ' && i < s.length()){ flag = 1; i++; } if(flag == 1) count++; } return count; }};

方法二:

class Solution {public: int countSegments(string s) { int count = 0; s += ' '; for(int i = 1; i < s.length(); i++){ if(s[i-1] != ' ' && s[i] == ' ') count++; } return count; }};
上一篇:web.xml文件详解

下一篇:Prime Ring Problem

发表评论 共有条评论
用户名: 密码:
验证码: 匿名发表