Simple solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: $O(n)$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $O(1)$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def maxPower(self, s: str) -> int:\n        max_power = 1\n        count = 1\n\n        i = 1\n        while i < len(s):\n            if s[i] == s[i - 1]:\n                count += 1\n            else:\n                count = 1\n            i += 1\n            max_power = max(count, max_power)\n\n        return max_power\n```
['Python3']