Fixed sonar warnings.

Author: javadev

src/main/java/g1701_1800/s1726_tuple_with_same_product/Solution.java

@@ -3,23 +3,21 @@
 // #Medium #Array #Hash_Table #2022_04_28_Time_235_ms_(90.73%)_Space_63.4_MB_(87.42%)
 
 import java.util.HashMap;
+import java.util.Map;
 
 public class Solution {
     public int tupleSameProduct(int[] nums) {
         HashMap<Integer, Integer> ab = new HashMap<>();
-
         for (int i = 0; i < nums.length; i++) {
             for (int j = i + 1; j < nums.length; j++) {
                 ab.put(nums[i] * nums[j], ab.getOrDefault(nums[i] * nums[j], 0) + 1);
             }
         }
-
         int count = 0;
-        for (Integer key : ab.keySet()) {
-            int val = ab.get(key);
+        for (Map.Entry<Integer, Integer> entry : ab.entrySet()) {
+            int val = entry.getValue();
             count = count + (val * (val - 1)) / 2;
         }
-
         return count * 8;
     }
 }

src/main/java/g1701_1800/s1728_cat_and_mouse_ii/Solution.java

@@ -6,8 +6,9 @@
 import java.util.ArrayList;
 import java.util.List;
 
+@SuppressWarnings("unchecked")
 public class Solution {
-    private final int mouseTurn = 0;
+    private static final int MOUSE_TURN = 0;
     private final List<Integer>[][] graphs = new List[2][];
     private int foodPos;
     private int[][][] memo;
@@ -42,7 +43,7 @@ public boolean canMouseWin(String[] grid, int catJump, int mouseJump) {
                 dfs(i * n + j, foodPos, catTurn);
             }
         }
-        return memo[mousePos][catPos][mouseTurn] < 0;
+        return memo[mousePos][catPos][MOUSE_TURN] < 0;
     }
 
     private List<Integer>[] buildGraph(int jump, String[] grid) {
@@ -86,9 +87,7 @@ private void dfs(int p1, int p2, int turn) {
         memo[p1][p2][turn] = -1;
         turn ^= 1;
         for (int w : graphs[turn][p2]) {
-            if (turn == mouseTurn) {
-                dfs(w, p1, turn);
-            } else if (++memo[w][p1][turn] == graphs[turn][w].size()) {
+            if (turn == MOUSE_TURN || ++memo[w][p1][turn] == graphs[turn][w].size()) {
                 dfs(w, p1, turn);
             }
         }