g0401_0500.s0424_longest_repeating_character_replacement

Class Solution

java.lang.Object

g0401_0500.s0424_longest_repeating_character_replacement.Solution

public class Solution
extends Object

424 - Longest Repeating Character Replacement.

Medium

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:

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.

Constraints:

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

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
int	characterReplacement(String s, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Solution

public Solution()

Method Detail

characterReplacement

public int characterReplacement(String s,
                                int k)