# consecutive-characters


Try it on <a href='https://leetcode.com/problems/consecutive-characters'>leetcode</a>

## Description
<div class="description">
<div><p>The <strong>power</strong> of the string is the maximum length of a non-empty substring that contains only one unique character.</p>

<p>Given a string <code>s</code>, return <em>the <strong>power</strong> of</em> <code>s</code>.</p>

<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>

<pre><strong>Input:</strong> s = "leetcode"
<strong>Output:</strong> 2
<strong>Explanation:</strong> The substring "ee" is of length 2 with the character 'e' only.
</pre>

<p><strong>Example 2:</strong></p>

<pre><strong>Input:</strong> s = "abbcccddddeeeeedcba"
<strong>Output:</strong> 5
<strong>Explanation:</strong> The substring "eeeee" is of length 5 with the character 'e' only.
</pre>

<p><strong>Example 3:</strong></p>

<pre><strong>Input:</strong> s = "triplepillooooow"
<strong>Output:</strong> 5
</pre>

<p><strong>Example 4:</strong></p>

<pre><strong>Input:</strong> s = "hooraaaaaaaaaaay"
<strong>Output:</strong> 11
</pre>

<p><strong>Example 5:</strong></p>

<pre><strong>Input:</strong> s = "tourist"
<strong>Output:</strong> 1
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 500</code></li>
	<li><code>s</code> consists of only lowercase English letters.</li>
</ul>
</div>
</div>

## Solution(Python)
```Python
class Solution:
    def maxPower(self, s: str) -> int:
        power = 0
        maxpower = 0
        previous = None
        for c in s:
            if c == previous:
                power += 1
            else:
                power = 1
                previous = c
            if power > maxpower:
                maxpower = power
        return maxpower

```