We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 7c16368 commit db6c636Copy full SHA for db6c636
src/main/java/com/thealgorithms/strings/SuffixArray.java
@@ -32,7 +32,9 @@ public static int[] buildSuffixArray(String text) {
32
33
// Comparator: first by rank, then by rank + step
34
Arrays.sort(suffixArray, (a, b) -> {
35
- if (rank[a] != rank[b]) return Integer.compare(rank[a], rank[b]);
+ if (rank[a] != rank[b]){
36
+ return Integer.compare(rank[a], rank[b]);
37
+ }
38
int ra = (a + step < n) ? rank[a + step] : -1;
39
int rb = (b + step < n) ? rank[b + step] : -1;
40
return Integer.compare(ra, rb);
0 commit comments