替换k个字符后最长重复子串

2019独角兽企业重金招聘Python工程师标准>>>

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.

解决：

① 使用hash table记录字符出现的次数，使用滑动窗口控制最大连续的长度。

如果没有k的限制，让我们求把字符串变成只有一个字符重复的字符串需要的最小置换次数，那么就是字符串的总长度减去出现次数最多的字符的个数。

如果加上k的限制，我们其实就是求满足(子字符串的长度减去出现次数最多的字符个数)<=k的最大子字符串长度即可。

class Solution { //19ms
    public int characterReplacement(String s, int k) {
        if (s == null || s.length() == 0) return 0;
        int[] hash = new int[26];
        int maxOccur = ++ hash[s.charAt(0) - 'A'];
        int maxLen = 1;
        int start = 0;
        for (int end = 1;end < s.length();end ++){
            maxOccur = Math.max(maxOccur,++ hash[s.charAt(end) - 'A']);
            if (end - start + 1 > maxOccur + k){
                hash[s.charAt(start ++) - 'A'] --;
            }else{
                maxLen = Math.max(maxLen,end - start + 1);
            }
        }
        return maxLen;
    }
}

转载于:https://my.oschina.net/liyurong/blog/1601485