思路:最长子字符串->滑动窗口
官解:
class Solution {
public:
int characterReplacement(string s, int k) {
int flag[26] = {0};
int n = s.size(), l = 0, ans = 0, _max = 0;
for (int r = 0; r < n; ++r) {
flag[s[r] - 'A']++;
_max = max(_max, flag[s[r] - 'A']);
if (_max + k < r - l + 1) flag[s[l++] - 'A']--;
}
return n - l;
}
};