解题思路:
通过双指针标记,用left指针指向连续的第一个位置,right不断向后找最后位置,然后更新能量,代码如下:
class Solution {
public:
int maxPower(string s) {
int energy = 0;
int left = 0, right = 0;
while(right < s.size()) {
if(s[right] == s[left]) {
right ++;
} else {
energy = max(energy, right - left);
left = right;
}
}
energy = max(energy, right - left);
return energy;
}
};