LeetCode 434. Number of Segments in a String #89
quinnwencn
started this conversation in
General
Replies: 2 comments
-
AnalysisSolution written in CppSolution written in Rustimpl Solution {
pub fn count_segments(s: String) -> i32 {
if s.len() == 0 {
return 0;
}
let vs: Vec<&str> = s.split_whitespace().collect();
vs.len() as i32
}
} |
Beta Was this translation helpful? Give feedback.
0 replies
-
|
In Rust, |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
Description
Given a string s, return the number of segments in the string.
A segment is defined to be a contiguous sequence of non-space characters.
Example 1:
Input: s = "Hello, my name is John"
Output: 5
Explanation: The five segments are ["Hello,", "my", "name", "is", "John"]
Example 2:
Input: s = "Hello"
Output: 1
Constraints:
0 <= s.length <= 300
s consists of lowercase and uppercase English letters, digits, or one of the following characters "!@#$%^&*()_+-=',.:".
The only space character in s is ' '.
Beta Was this translation helpful? Give feedback.
All reactions