LeetCode每日一题-9：替换后的最长重复字符串

class Solution:
    def characterReplacement(self, s: str, k: int) -> int:
        from collections import defaultdict
        d = defaultdict(int)
        l = 0
        maxn = 0
        for r in range(len(s)):
            d[s[r]] += 1
            maxn = max(maxn, d[s[r]])
            if r - l + 1 > maxn + k:  # bc it is for loop, r += 1 is later than if clause
                d[s[l]] -= 1
                l += 1
        return len(s) - l

class Solution {
    public int characterReplacement(String s, int k) {
        int len=s.length();
        if(len<2){
            return len;
        }
        char[] chararray=s.toCharArray();
        int left=0,right=0;
        int maxCount=0,res=0;
        int[] freq = new int[26];
        while(right<len){
            freq[chararray[right]-'A']++;
            maxCount=Math.max(maxCount,freq[chararray[right]-'A']);
            right++;
            if(right-left>maxCount+k){
                freq[chararray[left]-'A']--;
                left++;
            }
            res=Math.max(res,right-left);
            
        }
        return res;
    }
}