Leetcode 434. Number of Segments in a String (Easy) (cpp)

Niko_Ke

于 2016-12-25 00:32:35 发布

阅读量605

点赞数

分类专栏： Leetcode C++ C++ Leetcode String 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/Niko_Ke/article/details/53865314

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode String

34 篇文章 0 订阅

订阅专栏

Leetcode 434. Number of Segments in a String (Easy) (cpp)

Tag: String

Difficulty: Easy

/*

434. Number of Segments in a String (Easy)

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