Fixed sonar

Author: javadev

src/main/java/g3401_3500/s3470_permutations_iv/Solution.java

@@ -10,11 +10,11 @@ public class Solution {
     // Define a large constant value to cap calculations and prevent overflow
     private static final long CAP = 1000000000000001L;
     // 3D DP array to store precomputed results for dynamic programming
-    private final long[][][] dp = new long[105][105][3];
+    private static final long[][][] DP = new long[105][105][3];
 
     // Initialize DP array with -1 (indicating uncomputed states)
-    {
-        for (long[][] longs : dp) {
+    static {
+        for (long[][] longs : DP) {
             for (long[] aLong : longs) {
                 Arrays.fill(aLong, -1);
             }
@@ -26,8 +26,8 @@ private long rec(int o, int e, int req) {
         if (o == 0 && e == 0) {
             return 1;
         }
-        if (dp[o][e][req] != -1) {
-            return dp[o][e][req];
+        if (DP[o][e][req] != -1) {
+            return DP[o][e][req];
         }
         long count = 0;
         if (req == 2) {
@@ -42,7 +42,7 @@ private long rec(int o, int e, int req) {
         } else {
             if (e > 0) count = multiplyCapped(e, rec(o, e - 1, 0));
         }
-        dp[o][e][req] = count;
+        DP[o][e][req] = count;
         return count;
     }