JAVA_LeetCode 424_Longest Repeating Character Replacement 풀이 class Solution { public int characterReplacement(String s, int k) { int left = 0, maxFreq = 0, maxLen = 0; int[] count = new int[26]; for(int right = 0; right < s.length(); right++){ int idx = s.charAt(right) - 'A'; count[idx]++; maxFreq = Math.max(maxFreq, count[idx]); while((right - left + 1) - maxFreq > k){ count[s.charAt(left) - 'A']--; left++; } maxLen = Math.max(maxLen, right - left + 1); } return maxLen; } } 연속된 문자, 최대 빈도, 슬라이딩 ...
