update post

Author: dev-jonghoonpark

_posts/2024-04-29-leetcode-424.md

@@ -68,3 +68,50 @@ class Solution {
 ### TC, SC
 
 시간 복잡도는 O(n)이고, 공간 복잡도는 O(1)이다.
+
+## 다시 풀어보기 (240603)
+
+지난번에 참고했던 풀이를 보지 않고 다시 풀어보았다. 다시 풀어봐도 어려운 문제였다.
+
+```java
+class Solution {
+    public int characterReplacement(String s, int k) {
+            int[] counter = new int[26];
+            int countOfMostFrequent = -1;
+
+            int headPointer = 0;
+            int tailPointer = 0;
+
+            int maxLength = 0;
+
+            while (headPointer < s.length()) {
+                char head = s.charAt(headPointer);
+                char tail = s.charAt(tailPointer);
+                counter[head - 'A']++;
+                headPointer++;
+
+                countOfMostFrequent = getCountOfMostFrequent(counter[head - 'A'], countOfMostFrequent);
+                while (headPointer - tailPointer > countOfMostFrequent + k) {
+                    counter[tail - 'A']--;
+                    tailPointer++;
+                    tail = s.charAt(tailPointer);
+                }
+
+                maxLength = Math.max(maxLength, headPointer - tailPointer);
+                System.out.printf("%d, %d, %s\n", tailPointer, headPointer, s.substring(tailPointer, headPointer));
+            }
+
+            return maxLength;
+    }
+
+    int getCountOfMostFrequent(int challenge, int countOfMostFrequent) {
+        return Math.max(challenge, countOfMostFrequent);
+    }
+}
+```
+
+### TC, SC
+
+시간 복잡도는 O(n)이고, 공간 복잡도는 O(1)이다.
+
+![final result](/assets/images/2024-04-29-leetcode-424/final-result.png)