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 stringGiven a string that consists of only upperc
阅读背景：
Leetcode: Longest Repeating Character Replacement && G 面经
来源：互联网
分享到：
