Update Solution.java

Author: javadev

src/main/java/g1401_1500/s1444_number_of_ways_of_cutting_a_pizza/Solution.java

@@ -3,6 +3,7 @@
 // #Hard #Array #Dynamic_Programming #Matrix #Memoization
 // #2022_03_28_Time_14_ms_(46.03%)_Space_41.8_MB_(65.08%)
 
+@SuppressWarnings("java:S2234")
 public class Solution {
     private static final int K_MOD = (int) (1e9 + 7);
 
@@ -23,17 +24,14 @@ public int ways(String[] pizza, int k) {
                                 - prefix[i][j];
             }
         }
-
         int[][][] dp = new int[m][n][k];
-
         for (int i = 0; i < m; ++i) {
             for (int j = 0; j < n; ++j) {
                 for (int s = 0; s < k; ++s) {
                     dp[i][j][s] = -1;
                 }
             }
         }
-
         return dfs(0, 0, m, n, k - 1, prefix, dp);
     }
 
@@ -44,7 +42,6 @@ private int dfs(int m, int n, int temp1, int temp2, int k, int[][] prefix, int[]
         if (dp[m][n][k] != -1) {
             return dp[m][n][k];
         }
-
         int local = 0;
         for (int x = m; x < temp1 - 1; ++x) {
             local =
@@ -60,7 +57,6 @@ private int dfs(int m, int n, int temp1, int temp2, int k, int[][] prefix, int[]
                                             * dfs(m, y + 1, temp1, temp2, k - 1, prefix, dp))
                             % K_MOD;
         }
-
         dp[m][n][k] = local;
         return dp[m][n][k];
     }