<div id="readability-page-1" class="page"><div>
            <h2 id="%EB%AC%B8%EC%A0%9C">문제</h2><figure><a href="https://leetcode.com/problems/longest-repeating-character-replacement/"><div><p>Loading...</p><p>Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.</p><p><img src="https://leetcode.com/favicon-192x192.png"><span>LeetCode</span></p></div><p><img src="https://leetcode.com/static/images/LeetCode_Sharing.png"></p></a></figure><h2 id="%ED%92%80%EC%9D%B4">풀이</h2><p>슬라이딩 윈도우 풀이</p><pre><code>class Solution:
    def characterReplacement(self, s, k):
        max_freq = res = 0
        count = collections.Counter()

        left = right = 0

        while right &lt; len(s):
            count[s[right]] += 1
            max_freq = max(max_freq, count[s[right]])

            if res &lt; max_freq + k:
                res += 1
            else:
                count[s[right - res]] -= 1
                left += 1

            right += 1
        return res</code></pre>
        </div></div>

일시불 프로그래밍

문제
풀이
슬라이딩 윈도우 풀이
class Solution:
    def characterReplacement(self, s, k):
        max_freq = res = 0
        count = collections.Counter()
        left = right = 0
        while right < len(s):
            count[s[right]] += 1
            max_freq = max(max_freq, count[s[right]])
            if res < max_freq + k:
                res += 1
            else:
                count[s[right - res]] -= 1
                left += 1
            right += 1
        return res

Leetcode - 424. Longest Repeating Character Replacement

댓글