每天一道LeetCode--434. Number of Segments in a String
2016-12-05 21:23
190 查看
Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.
For example,
Input:
Output:
For example,
Input:
"Hello, my name is John"
Output:
5
public int countSegments(String s) { String trimmed = s.trim(); if (trimmed.length() == 0) return 0; else return trimmed.split("\\s+").length; }
相关文章推荐
- 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: Python]434. Number of Segments in a String
- Leetcode 434. Number of Segments in a String (Easy) (cpp)
- LeetCode 434. Number of Segments in a String
- leetcode 434. Number of Segments in a String 按照空格分割字符串 + C++的stringstream的一个很好应用示范
- 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 解题报告