@@ -20,19 +20,19 @@ private static List<Integer> findAllAnagramsInTextNaive(String text, String patt
20
20
21
21
char [] patternChars = pattern .toCharArray ();
22
22
Arrays .sort (patternChars ); // takes O(m log m) time
23
- String sortedPattern = String .valueOf (patternChars );
23
+ String patternSorted = String .valueOf (patternChars );
24
24
25
25
String subText ;
26
26
char [] subTextChars ;
27
- String sortedSubText ;
27
+ String subTextSorted ;
28
28
29
29
for (int i = 0 ; i <= textLen - patternLen ; i ++) { // loops n-m number of times
30
30
subText = text .substring (i , i + patternLen );
31
31
subTextChars = subText .toCharArray ();
32
32
Arrays .sort (subTextChars ); // sorts m number of characters, takes O(m log m)
33
- sortedSubText = String .valueOf (subTextChars );
33
+ subTextSorted = String .valueOf (subTextChars );
34
34
35
- if (sortedSubText .equals (sortedPattern )) { // compare m characters takes m time
35
+ if (subTextSorted .equals (patternSorted )) { // compare m characters takes m time
36
36
indexes .add (i );
37
37
}
38
38
}
0 commit comments