consecutive_char

#https://leetcode.com/problems/consecutive-characters/
    def maxPower(self, s: str) -> int:
        str_list = list(s)
        count = prev_count= 1
        prev = str_list[0]
        for letter in str_list[1:]:
            if letter == prev:
                count += 1
            else:
                count = max(count,prev_count)
                prev_count = count
                count=1
            prev = letter
        return max(count, prev_count)