Solution (leetcode-in-java 1.21 API)

java.lang.Object
- g1401_1500.s1446_consecutive_characters.Solution

```
public class Solution
extends Object
```
1446 - Consecutive Characters.
Easy

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.

Constraints:
- 1 <= s.length <= 500
- s consists of only lowercase English letters.

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int maxPower(String s)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail
- maxPower
```
public int maxPower(String s)
```