424. Longest Repeating Character Replacement

Posted on Edited on In

424. Longest Repeating Character Replacement

Description

Difficulty: Medium

Related Topics: Hash Table, String, Sliding Window

You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most k times.

Return the length of the longest substring containing the same letter you can get after performing the above operations.

Example 1:

1
2
3
Input: s = "ABAB", k = 2
Output: 4
Explanation: Replace the two 'A's with two 'B's or vice versa.

Example 2:

1
2
3
4
5
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.
There may exists other ways to achieve this answer too.

Constraints:

  • 1 <= s.length <= 105
  • s consists of only uppercase English letters.
  • 0 <= k <= s.length

Hints/Notes

  • 2023/11/24
  • sliding window
  • need to think more about correctness
  • No solution from 0x3F

Solution

Language: C++

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class Solution {
public:
    int characterReplacement(string s, int k) {
        vector<int> count(26, 0);
        int left = 0, right = 0, res = 0, windowMaxCount = 0;
        while (right < s.size()) {
            count[s[right] - 'A']++;
            windowMaxCount = max(windowMaxCount, count[s[right] - 'A']);
            if (right - left + 1 - windowMaxCount > k) {
                count[s[left++] - 'A']--;
            }
            right++;
            res = max(res, right - left);
        }
        return res;
    }
};