[LeetCode] 434. Number of Segments in a String
2017-08-07 12:32
477 查看
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:
Please note that the string does not contain any non-printable characters.
Example:
Input: "Hello, my name is John" Output: 5
// Runtime: 0ms class Solution { public: int countSegments(string s) { istringstream is(s); int cnt = 0; for (string word; is >> word; cnt++) ; return cnt; } };
相关文章推荐
- LeetCode-434. Number of Segments in a String
- leetcode -- 434. Number of Segments in a String 【字符串处理】
- [LeetCode]434. Number of Segments in a String
- 【Leetcode】434. Number of Segments in a String
- LeetCode-434. Number of Segments in a String
- LeetCode 434. Number of Segments in a String
- LeetCode 434. Number of Segments in a String
- 【LeetCode】 434. Number of Segments in a String
- leetcode - 434. Number of Segments in a String
- [Leetcode] 434. Number of Segments in a String 解题报告
- Leetcode 434. Number of Segments in a String 字符串的分段 解题报告
- LeetCode-Easy部分中标签为String 434. Number of Segments in a String
- Leetcode——434. Number of Segments in a String
- LeetCode 434. Number of Segments in a String
- LeetCode 434. Number of Segments in a String
- [leetcode: Python]434. Number of Segments in a String
- leetcode 434. Number of Segments in a String
- leetcode 434. Number of Segments in a String
- LeetCode 434. Number of Segments in a String
- LeetCode-434. Number of Segments in a String