Fixed sonar

Author: javadev

src/main/java/g3301_3400/s3309_maximum_possible_number_by_binary_concatenation/Solution.java

@@ -23,9 +23,8 @@ public int maxGoodNumber(int[] nums) {
     private void solve(int[] nums, boolean[] visited, int pos, StringBuilder sb) {
         if (pos == nums.length) {
             String val = sb.toString();
-            if (result.length() == val.length() && result.compareTo(val) < 0) {
-                result = val;
-            } else if (val.length() > result.length()) {
+            if ((result.length() == val.length() && result.compareTo(val) < 0)
+                    || val.length() > result.length()) {
                 result = val;
             }
             return;

src/main/java/g3301_3400/s3310_remove_methods_from_project/Solution.java

@@ -19,12 +19,10 @@ public List<Integer> remainingMethods(int n, int k, int[][] invocations) {
         dfs(k, true);
         Arrays.fill(visited, false);
         for (int i = 0; i < n; i++) {
-            if (!suspicious[i]) {
-                if (dfs2(i)) {
-                    Arrays.fill(visited, false);
-                    dfs(k, false);
-                    break;
-                }
+            if (!suspicious[i] && dfs2(i)) {
+                Arrays.fill(visited, false);
+                dfs(k, false);
+                break;
             }
         }
         ArrayList<Integer> rst = new ArrayList<>();
@@ -64,17 +62,14 @@ public boolean dfs2(int u) {
     }
 
     private void pack(int[][] edges, int n) {
-        int m = edges.length;
         int[] adj = new int[n];
         for (int[] edge : edges) {
             adj[edge[0]]++;
         }
-
         graph = new int[n][];
         for (int i = 0; i < n; i++) {
             graph[i] = new int[adj[i]];
         }
-
         for (int[] edge : edges) {
             graph[edge[0]][--adj[edge[0]]] = edge[1];
         }

src/main/java/g3301_3400/s3311_construct_2d_grid_matching_graph_layout/Solution.java

@@ -55,27 +55,7 @@ public int[][] constructGridLayout(int n, int[][] edges) {
             }
         }
         if (row2 >= 0) {
-            res = new int[2][n / 2];
-            res[0][0] = st;
-            res[1][0] = row2;
-            seen[st] = seen[row2] = true;
-            for (int i = 1; i < res[0].length; ++i) {
-                for (int a : als[res[0][i - 1]]) {
-                    if (!seen[a]) {
-                        res[0][i] = a;
-                        seen[a] = true;
-                        break;
-                    }
-                }
-                for (int a : als[res[1][i - 1]]) {
-                    if (!seen[a]) {
-                        res[1][i] = a;
-                        seen[a] = true;
-                        break;
-                    }
-                }
-            }
-            return res;
+            return getInts(n, st, row2, seen, als);
         }
         final ArrayList<Integer> al = new ArrayList<>();
         boolean f = true;
@@ -112,4 +92,29 @@ public int[][] constructGridLayout(int n, int[][] edges) {
         }
         return res;
     }
+
+    private int[][] getInts(int n, int st, int row2, boolean[] seen, ArrayList<Integer>[] als) {
+        int[][] res;
+        res = new int[2][n / 2];
+        res[0][0] = st;
+        res[1][0] = row2;
+        seen[st] = seen[row2] = true;
+        for (int i = 1; i < res[0].length; ++i) {
+            for (int a : als[res[0][i - 1]]) {
+                if (!seen[a]) {
+                    res[0][i] = a;
+                    seen[a] = true;
+                    break;
+                }
+            }
+            for (int a : als[res[1][i - 1]]) {
+                if (!seen[a]) {
+                    res[1][i] = a;
+                    seen[a] = true;
+                    break;
+                }
+            }
+        }
+        return res;
+    }
 }