We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent f67aeb6 commit 4afbbbeCopy full SHA for 4afbbbe
src/main/java/g3301_3400/s3327_check_if_dfs_strings_are_palindromes/Solution.java
@@ -35,16 +35,16 @@ private void matcher() {
35
}
36
int j = 1;
37
int mid = 0;
38
- int r = 0;
+ int localR = 0;
39
while (j <= 2 * n + 1) {
40
- if (j <= r) {
41
- p[j] = Math.min(p[(mid << 1) - j], r - j + 1);
+ if (j <= localR) {
+ p[j] = Math.min(p[(mid << 1) - j], localR - j + 1);
42
43
while (c[j - p[j]] == c[j + p[j]]) {
44
++p[j];
45
46
- if (p[j] + j > r) {
47
- r = p[j] + j - 1;
+ if (p[j] + j > localR) {
+ localR = p[j] + j - 1;
48
mid = j;
49
50
++j;
0 commit comments