题目链接:https://leetcode-cn.com/problems/consecutive-characters/
题目如下:
class Solution {
public:
int maxPower(string s) {
if(s.size()==0) return 0;
if(s.size()==1) return 1;
int result=0,temp=1;
for(int i=1;i<s.size();i++){
if(s[i]==s[i-1]) temp++;
else{
if(temp>result) result=temp;
temp=1;
}
}
//这里为注意点
if(temp>result) return temp;
else return result;
}
};