consecutive-characters

Try it on leetcode

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.

Solution(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