Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 434 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 434 # by problem number
lcpy gen -s number_of_segments_in_a_string # by problem name
s, return the number of segments in the string.
A segment is defined to be a contiguous sequence of non-space characters.
Input: s = "Hello, my name is John"
Output: 5
Explanation: The five segments are ["Hello,", "my", "name", "is", "John"]
Input: s = "Hello"
Output: 1
class Solution:
# Time: O(n)
# Space: O(1)
def count_segments(self, s: str) -> int:
count = 0
in_segment = False
for ch in s:
if ch != " " and not in_segment:
count += 1
in_segment = True
elif ch == " ":
in_segment = False
return count
| Time | Space |
|---|---|
| O(n) | O(1) |