LeetCode480

替换后的最长重复字符

分析

滑动窗口分析最长连续最值。

class Solution {
public:
    int characterReplacement(string s, int k) {
        map<char, int>mp;
        int l = 0, r = 0;
        int ans = 0;
        while (r < s.size()) {
            mp[s[r]]++;
            ans = max(ans, mp[s[r]]);
            if (ans + k < r - l + 1) {
                mp[s[l]]--;
                l++;
            }
            r++;
        }
        return s.size()-l;
    }
};