easy faster than 90% cpp solution
\nclass Solution {\npublic:\n    int maxPower(string s) {\n        size_t max = 1;\n        size_t curr = 1;\n        for (size_t i = 1; i < s.size(); i++) {\n 
```\nclass Solution {\npublic:\n    int maxPower(string s) {\n        size_t max = 1;\n        size_t curr = 1;\n        for (size_t i = 1; i < s.size(); i++) {\n            if (s[i - 1] == s[i]) curr++;\n            else {\n                if (curr > max) max = curr;\n                curr = 1;\n            }\n        }\n        if (curr > max) max = curr; // edge case\n        return max;\n    }\n};\n```
['C', 'C++']