<reponame>VinceW0/Leetcode_Python_solutions
"""
1446. Consecutive Characters
Easy 

Similar: 0485. Max Consecutive Ones

Given a string s, the power of the string is the maximum length of a non-empty substring that contains only one unique character.

Return the power of the string.
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 contains only lowercase English letters.
"""

class Solution:
    def maxPower(self, s: str):
        res = 1
        cnt = 1
        for i in range(1, len(s)):
            if s[i] == s[i - 1]:
                cnt += 1
            else:
                res = max(res, cnt)
                cnt = 1
        return max(res, cnt)

"""
1446. Consecutive Characters
Easy 

Similar: 0485. Max Consecutive Ones

Given a string s, the power of the string is the maximum length of a non-empty substring that contains only one unique character.

Return the power of the string.
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 contains only lowercase English letters.
"""

class Solution:
    def maxPower(self, s: str):
        res = 1
        cnt = 1
        for i in range(1, len(s)):
            if s[i] == s[i - 1]:
                cnt += 1
            else:
                res = max(res, cnt)
                cnt = 1
        return max(res, cnt)
1446. Consecutive Characters Easy   Similar: 0485. Max Consecutive Ones  Given a string s, the power of the string is the maximum length of a non-empty substring that contains only one unique character.  Return the power of the string. 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 contains only lowercase English letters.