424. Longest Repeating Character Replacement

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.

思路：对于不同的字符，依次遍历其能组成的最长重复字符串，重点在每次在一个新的字符开始寻找最长重复字符串时，如果到了结尾，但替换次数仍大于0,且它的其实位置为i时，此时的长度tl=j-i+min(count,i).

class Solution {
public:
    int characterReplacement(string s, int k) {
        int len = s.length();
        int maxlen = 0,tl=0;//tl是tmp_len，当前字符的最长重复值
        for (int i = 0; i < len; ++i) {
            if (i > 0 && s[i] == s[i-1]) continue;
            char cur_letter = s[i];
            int count = k;
            int j;
            for (j = i+1; j < len; ++j) {
                if (s[j] != cur_letter) count--;
                if (count < 0) break;
            }
            if(j==len&&count>0) tl=j-i+min(count,i);
            else tl=j-i;
            maxlen = max(maxlen, tl);
        }
        return maxlen;
    }
};