# LeetCode 434. Number of Segments in a String

## Description

https://leetcode.com/problems/number-of-segments-in-a-string/

You are given a string `s`, return the number of segments in the string

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
```

Example 3:

```Input: s = "love live! mu'sic forever"
Output: 4
```

Example 4:

```Input: s = ""
Output: 0
```

Constraints:

• `0 <= s.length <= 300`
• `s` consists of lower-case and upper-case English letters, digits or one of the following characters `"!@#\$%^&*()_+-=',.:"`.
• The only space character in `s` is `' '`.

## Explanation

Just spit the string and count the splits.

## Python Solution

``````class Solution:
def countSegments(self, s: str) -> int:
words = s.split()

return len(words)``````
• Time Complexity: O(N).
• Space Complexity: O(N).