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;
        }
    }
  • 相关阅读:
    uniapp开发微信小程序
    requests自动登录禅道并提交bug 测试
    [转载]使用CPU时间戳进行高精度计时
    lu面
    音量控制面板项目说明
    【转载】粤语翻译工具
    专业操盘手的买卖法则
    自动刷新查询火车票脚本
    股东权益和权益比
    异形魔方SQ1的暴力解法
  • 原文地址:https://www.cnblogs.com/fatttcat/p/11388112.html
Copyright © 2011-2022 走看看