zoukankan      html  css  js  c++  java
  • 424. Longest Repeating Character Replacement

    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 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.

    sliding window

    time = O(n), space = O(1)

    class Solution {
        public int characterReplacement(String s, int k) {
            int[] count = new int[26];
            // maxCount: max # of unique characters in the current window
            int slow = 0, fast = 0, counter = 0, maxCount = 0, maxLen = 0;
            while(fast < s.length()) {
                count[s.charAt(fast) - 'A']++;
                maxCount = Math.max(maxCount, count[s.charAt(fast) - 'A']);
                fast++;
                
                // end - start - maxCount: # of characters that are NOT the character that occurs the most in the window
                while(fast - slow - maxCount > k) {
                    count[s.charAt(slow) - 'A']--;
                    slow++;
                }
                maxLen = Math.max(maxLen, fast - slow);
            }
            return maxLen;
        }
    }
  • 相关阅读:
    糊涂的教授
    有趣的英语角
    聚会
    新年礼物
    三核苷酸
    数字编码
    【同行说技术】iOS程序员从小白到大神必读资料汇总
    【同行说技术】Android图片处理技术资料汇总(一)
    【同行说技术】swift最全学习资料汇集(一)
    【同行说技术】iOS程序员从小白到大神必读资料汇总(一)
  • 原文地址:https://www.cnblogs.com/fatttcat/p/11388112.html
Copyright © 2011-2022 走看看