[WXM] LeetCode 424. Longest Repeating Character Replacement C++

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.

##Approach

1. 题目大意就是可修改字母k次，然后求最长的字母全相等的字符串。这道题很难想，最后看了大神的播客才知道要用滑动窗口的思想，在一个区间内修改字母的次数并使得这个区间内的所有字母都相同的所需要的次数是区间的长度减去出现次数最多的字母，所以我们就可以用这个方法来解决，我们来维护一个窗口，并使得修改的次数最多不超过k次。
   ##Code

class Solution {
public:
	int characterReplacement(string s, int k) {
		vector<int>letter(26, 0);
		int left = 0, maxn = 0, n = s.size(), res = 0;
		for (int i = 0; i < n; i++) {
			maxn = max(maxn, ++letter[s[i] - 'A']);
			while (i - left + 1 - maxn > k) {
				--letter[s[left++] - 'A'];
			}
			res = max(i - left + 1, res);
		}
		return res;
	}
};