Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k times. Find the length of a longest substring containing all repeating letters you can get after performing the above operations.
Note:
Both the string's length and k will not exceed 104.
Example 1:
Input: s = "ABAB", k = 2 Output: 4 Explanation: Replace the two 'A's with two 'B's or vice versa.
Example 2:
Input: s = "AABABBA", k = 1 Output: 4 Explanation: Replace the one 'A' in the middle with 'B' and form "AABBBBA". The substring "BBBB" has the longest repeating letters, which is 4.
滑动窗口问题,其实还没有很好地理解这个问题 需要再继续想一想
public class Solution {
public int characterReplacement(String s, int k) {
if(s.length()==0||s==null) return 0;
int[]letter=new int[26];
int l=0;
int res=1;
int most=++letter[s.charAt(0)-'A'];
int i=0;
for(i=1;i<s.length();i++){
most=Math.max(most,++letter[s.charAt(i)-'A']);
if(most+k<i-l+1){
letter[s.charAt(l)-'A']--;
l++;
}
res=Math.max(res,i-l+1);
}
return res;
}
}