We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent eb2895c commit 4239517Copy full SHA for 4239517
src/main/java/g3101_3200/s3138_minimum_length_of_anagram_concatenation/Solution.java
@@ -23,14 +23,20 @@ public int minAnagramLength(String s) {
23
for (int j = 0; j < factors.size(); j++) {
24
int factor = factors.get(j);
25
if (factor == 1) {
26
- if (sq[0] * n == sq[n - 1]) return 1;
+ if (sq[0] * n == sq[n - 1]) {
27
+ return 1;
28
+ }
29
} else {
30
int sum = sq[factor - 1];
31
int start = 0;
32
for (int i = factor - 1; i < n; i += factor) {
- if (start + sum != sq[i]) break;
33
+ if (start + sum != sq[i]) {
34
+ break;
35
36
start += sum;
- if (i == n - 1) return factor;
37
+ if (i == n - 1) {
38
+ return factor;
39
40
}
41
42
0 commit comments