> For the complete documentation index, see [llms.txt](https://jaywin.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://jaywin.gitbook.io/leetcode/solutions/0434-number-of-segments-in-a-string.md).

# 0434. Number of Segments in a String

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

## Description

You are given a string `s`, return *the number of segments in the string*.&#x20;

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

**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 `' '`.

## ac

```java
```