LeetCode-424 Longest Repeating Character Replacement

Description

Given a string s that consists of only uppercase English letters, you can perform at most k operations on that string.

In one operation, you can choose any character of the string and change it to any other uppercase English character.

Find the length of the longest sub-string 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

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.

Submissions

首先介绍collections，其在python官方文档中的解释是High-performance container datatypes，高性能容量数据类型。其中Counter是计数器，count.most_common()对s中的元素进行统计。
利用滑动窗口，将left作为滑动窗口的左边界，然后遍历字符串s,并当前元素个数加一，后利用count.most_common(1)[0][1]输出出现频次最高元素的个数。再用窗口的长度减去出现频次最多的字符出现的次数，就得到了最少需要修改多少个字符才能将该滑动窗口变为全部相同的字符。如果差值大于k，则要修改的字符数多于k，不满足条件，将窗口的左边界向右移动到满足该条件为止，移动的同时将因为左边界移动导致的字符出现次数-1。用res保存最大的滑动窗口长度，最后返回即可。

实现代码如下：

class Solution:
    def characterReplacement(self, s: str, k: int) -> int:
        count = collections.Counter()
        left = 0
        res = 0
        for i, val in enumerate(s):
            count[val] += 1
            max_v = count.most_common(1)[0][1]
            if i-left+1-max_v > k:
                count[s[left]] -= 1
                left += 1
            res = max(res, i-left+1)
        return res