human
Can you provide a the Python program you requested given the following:
Solve in Python:
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.
assistant
#Here is the Python program you requested.

class Solution:
    def maxPower(self, s: str) -> int:

        count = 0
        new_count = 0
        for i,char in enumerate(s):

            print(char)
            try:
                if s[i+1] == char:
                    new_count += 1
                else:
                    print('afwww')
                    if new_count >= count:
                        count = new_count
                    new_count = 0
            except:
                print('sefesf')
                if new_count >= count:
                    print('sfwafawfawfawfawfawf')
                    count = new_count
                    new_count = 0
                break

        return count+1