Update 424.Longest-Repeating-Character-Replacement_v2.cpp

wisdompeak · web-flow · commit c2c91293f45d · 2021-10-02T15:10:05.000-07:00
diff --git a/Hash/424.Longest-Repeating-Character-Replacement/424.Longest-Repeating-Character-Replacement_v2.cpp b/Hash/424.Longest-Repeating-Character-Replacement/424.Longest-Repeating-Character-Replacement_v2.cpp
@@ -9,11 +9,11 @@ class Solution {
         
         for (int j=0; j<s.size(); j++)
         {
-            Count[s[j]-'A']++;
+            count[s[j]-'A']++;
             
-            while (j-i+1 - *max_element(Count.begin(),count.end()) > k)
+            while (j-i+1 - *max_element(count.begin(),count.end()) > k)
             {
-                Count[s[i]-'A']--;
+                count[s[i]-'A']--;
                 i++;                       
             }
             result = max(result, j-i+1);                                    

Original file line number	Diff line number	Diff line change
`@@ -9,11 +9,11 @@ class Solution {`
`9`	`9`
`10`	`10`	`for (int j=0; j<s.size(); j++)`
`11`	`11`	`{`
`12`		`- Count[s[j]-'A']++;`
	`12`	`+ count[s[j]-'A']++;`
`13`	`13`
`14`		`- while (j-i+1 - *max_element(Count.begin(),count.end()) > k)`
	`14`	`+ while (j-i+1 - *max_element(count.begin(),count.end()) > k)`
`15`	`15`	`{`
`16`		`- Count[s[i]-'A']--;`
	`16`	`+ count[s[i]-'A']--;`
`17`	`17`	`i++;`
`18`	`18`	`}`
`19`	`19`	`result = max(result, j-i+1);`