neetcode-gh#424 update

Author: briannej

python/424-Longest-Repeating-Character-Replacement.py

@@ -4,12 +4,10 @@ def characterReplacement(self, s: str, k: int) -> int:
         res = 0
 
         l = 0
-        maxf = 0
         for r in range(len(s)):
             count[s[r]] = 1 + count.get(s[r], 0)
-            maxf = max(maxf, count[s[r]])
 
-            if (r - l + 1) - maxf > k:
+            while (r - l + 1) - max(count.values()) > k:
                 count[s[l]] -= 1
                 l += 1