Fixed style

Author: javadev

src/main/java/g3301_3400/s3327_check_if_dfs_strings_are_palindromes/Solution.java

@@ -26,16 +26,20 @@ private void dfs(int x) {
         r[x] = ++now;
     }
 
-    private void manacher() {
+    private void matcher() {
         c[0] = '~';
         c[1] = '#';
         for (int i = 1; i <= n; ++i) {
             c[2 * i + 1] = '#';
             c[2 * i] = stringBuilder.charAt(i - 1);
         }
         for (int i = 1, mid = 0, r = 0; i <= 2 * n + 1; ++i) {
-            if (i <= r) p[i] = Math.min(p[(mid << 1) - i], r - i + 1);
-            while (c[i - p[i]] == c[i + p[i]]) ++p[i];
+            if (i <= r) {
+                p[i] = Math.min(p[(mid << 1) - i], r - i + 1);
+            }
+            while (c[i - p[i]] == c[i + p[i]]) {
+                ++p[i];
+            }
             if (p[i] + i > r) {
                 r = p[i] + i - 1;
                 mid = i;
@@ -57,7 +61,7 @@ public boolean[] findAnswer(int[] parent, String s) {
         dfs(0);
         c = new char[2 * n + 10];
         p = new int[2 * n + 10];
-        manacher();
+        matcher();
         boolean[] ans = new boolean[n];
         for (int i = 0; i < n; ++i) {
             int mid = (2 * r[i] - 2 * l[i] + 1) / 2 + 2 * l[i];