1class Solution {2 public:3 int ans = 1;4 int maxPower(string s) {5 for (int i = 0; i < size(s); ++i) {6 int j = i;7 while (j < size(s) and s[j] == s[i]) ++j;8 ans = max(ans, j - i);9 i = j - 1;10 }11 return ans;12 }13};
WPM •0 •0
ACC •0 •0
TIME •0