题目来源

• leetcode

题目描述

题目解析

class Solution {
public:
    int maxPower(string s) {
        int cnt = 1, max = cnt;
        for (int i = 1; i < s.size(); ++i) {
            if(s[i] == s[i - 1]){
                ++cnt;
                max = std::max(cnt, max);
            }else{
                cnt = 1;
            }
        }
        return max;
    }
};