int maxPower(string s) {
unordered_map<int, int> window;
int l = 0, r = 0;
bool flag1 = false;
int maxNum = 0;
while (r < s.size()) {
if (!flag1) {
char c = s[r];
r++;
window[c]++;
}
bool flag2 = false;
int count = 0;
for (auto it:window)
if (it.second != 0)
count++;
if (count == 1)
flag2 = true;
if (flag2) {
for (auto it:window)
maxNum = max(maxNum, it.second);
flag1 = false;
} else {
flag1 = true;
window[s[l++]]--;
}
}
return maxNum;
}
1446. 连续字符
最新推荐文章于 2021-12-01 09:20:06 发布