Leetcode 434. Number of Segments in a String (Easy) (cpp)
来源:互联网 发布:fifaol3vs数据库 编辑:程序博客网 时间:2024/05/08 18:23
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;}};
0 0
- Leetcode 434. Number of Segments in a String (Easy) (cpp)
- leetcode 434[easy]---Number of Segments in a String
- 434.Number of Segments in a String(String-Easy)
- LeetCode-Easy部分中标签为String 434. Number of Segments in a String
- leetcode 434.Number of Segments in a String(easy)[分割字符串]
- Leetcode Number of Segments in a String
- LEETCODE--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 434. Number of Segments in a String
- 关于Resources$NotFoundException: String resource ID 的异常
- Atitit 常用二维码对比(QR、PDF417、DM、汉信码 Aztec code maxicode
- 随机变量及其分布函数
- git 命令
- Git 使用总结
- Leetcode 434. Number of Segments in a String (Easy) (cpp)
- C#:用WebBrowser获取JS动态加载以后的页面代码并保存图片
- Atitit Data Matrix dm码的原理与特点
- 分布式跟踪系统(二):Zipkin的Span模型
- 【LeetCode】 389. Find the Difference
- tolua里C#与lua互调
- 计算机体系结构原理——数据操控(CPU工作原理)
- 关于IO流的输入输出流同时存在应如何处理异常?
- 关于Free-RTOS调度器启动前API调用造成中断关闭问题