> 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/1446-consecutive-characters.md).

# 1446. Consecutive Characters

<https://leetcode.com/problems/consecutive-characters>

## Description

The **power** of the string is the maximum length of a non-empty substring that contains only one unique character.

Given a string `s`, return *the **power** of* `s`.

**Example 1:**

```
**Input:** s = "leetcode"
**Output:** 2
**Explanation:** The substring "ee" is of length 2 with the character 'e' only.
```

**Example 2:**

```
**Input:** s = "abbcccddddeeeeedcba"
**Output:** 5
**Explanation:** The substring "eeeee" is of length 5 with the character 'e' only.
```

**Example 3:**

```
**Input:** s = "triplepillooooow"
**Output:** 5
```

**Example 4:**

```
**Input:** s = "hooraaaaaaaaaaay"
**Output:** 11
```

**Example 5:**

```
**Input:** s = "tourist"
**Output:** 1
```

**Constraints:**

* `1 <= s.length <= 500`
* `s` consists of only lowercase English letters.

## ac

```java
```