refactor(pom): Downgrade Java compiler version to 21

Author: lzwjava

pom.xml

@@ -11,8 +11,8 @@
     <description>Consolidated project for algorithm solutions from multiple platforms</description>
 
     <properties>
-        <maven.compiler.source>24</maven.compiler.source>
-        <maven.compiler.target>24</maven.compiler.target>
+        <maven.compiler.source>21</maven.compiler.source>
+        <maven.compiler.target>21</maven.compiler.target>
         <project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
         <problem>p140</problem>
         <codeforcesProblem>p71A</codeforcesProblem>

src/main/java/com/lzw/solutions/codeforces/p2190B1/Main.java

@@ -43,9 +43,9 @@ private static void solve() throws IOException {
             if (n == 2) {
                 ans = -1;
             } else {
-//                if (s.contains("()((")) {
-//                    ans = n - 2;
-//                } else {
+                //                if (s.contains("()((")) {
+                //                    ans = n - 2;
+                //                } else {
                 int[] array = new int[n];
                 int acc = 0;
                 for (int i = 0; i < n; i++) {
@@ -58,7 +58,7 @@ private static void solve() throws IOException {
                 }
                 printArray(array);
                 ans = 0;
-//                }
+                //                }
             }
             out.println(ans);
         }

src/main/java/com/lzw/solutions/codeforces/p2190B1/MainPlus.java

@@ -32,11 +32,11 @@ public static void main(String[] args) {
 
                 // now add the changed '('
                 bal += 1;
-                if (bal < 0) continue;  // though unlikely here
+                if (bal < 0) continue; // though unlikely here
 
                 // now from i+1 to end, greedily take as far as possible
                 // while keeping bal >= 0, and stop when bal returns to 0
-                int len = i + 1;           // 0-based: positions 0..i
+                int len = i + 1; // 0-based: positions 0..i
                 int startBal = bal;
 
                 for (int j = i + 1; j < n; j++) {
@@ -46,7 +46,7 @@ public static void main(String[] args) {
                     if (bal == 0) {
                         // found a valid completion
                         ans = Math.max(ans, len);
-                        break;  // no need to go further — longer won't be prefix-equal
+                        break; // no need to go further — longer won't be prefix-equal
                     }
                 }
             }
@@ -55,4 +55,4 @@ public static void main(String[] args) {
         }
         sc.close();
     }
-}
+}

src/main/java/com/lzw/solutions/codeforces/p2190B1/MainPro.java

@@ -13,7 +13,7 @@ public static void main(String[] args) {
 
             int ans = -1;
 
-            for (int split = 1; split <= n; split += 2) {  // possible lengths of t
+            for (int split = 1; split <= n; split += 2) { // possible lengths of t
                 // check if we can form a regular seq of length 'split' that is better than s
                 // i.e. first difference position has ( in t, ) in s
 
@@ -33,17 +33,17 @@ public static void main(String[] args) {
                             if (open > 0) {
                                 // we could close, but we decide to open instead
                                 foundDiff = true;
-                                open++;  // pretend we put (
+                                open++; // pretend we put (
                             } else {
-                                open--;  // forced to follow s
+                                open--; // forced to follow s
                             }
                         }
                     } else {
                         // after difference, freely choose to make it valid
                         if (open > 0 && i + 1 < split) {
-                            open--;  // prefer close if possible
+                            open--; // prefer close if possible
                         } else {
-                            open++;  // open
+                            open++; // open
                         }
                     }
 
@@ -62,4 +62,4 @@ public static void main(String[] args) {
         }
         sc.close();
     }
-}
+}

src/main/java/com/lzw/solutions/sample/pjava_sample_buf/Main.java

@@ -17,4 +17,4 @@ public static void main(String[] args) throws IOException {
         solve();
         out.close();
     }
-}
+}

src/main/java/com/lzw/solutions/uva/p1671/Main.java

@@ -34,4 +34,4 @@ public static void main(String[] args) throws IOException {
         solve();
         out.close();
     }
-}
+}