Fixed sonar

Author: javadev

src/main/java/g3101_3200/s3200_maximum_height_of_a_triangle/Solution.java

@@ -2,6 +2,7 @@
 
 // #Easy #Array #Enumeration #2024_07_04_Time_1_ms_(86.34%)_Space_40.5_MB_(90.34%)
 
+@SuppressWarnings("java:S135")
 public class Solution {
     private int count(int v1, int v2) {
         int ct = 1;

src/main/java/g3201_3300/s3203_find_minimum_diameter_after_merging_two_trees/Solution.java

@@ -25,40 +25,36 @@ public static int[] diameter(int[][] g) {
         int d01;
         int[] q = new int[n];
         boolean[] ved = new boolean[n];
-        {
-            int qp = 0;
-            q[qp++] = 0;
-            ved[0] = true;
-            for (int i = 0; i < qp; i++) {
-                int cur = q[i];
-                for (int e : g[cur]) {
-                    if (!ved[e]) {
-                        ved[e] = true;
-                        q[qp++] = e;
-                    }
+        int qp = 0;
+        q[qp++] = 0;
+        ved[0] = true;
+        for (int i = 0; i < qp; i++) {
+            int cur = q[i];
+            for (int e : g[cur]) {
+                if (!ved[e]) {
+                    ved[e] = true;
+                    q[qp++] = e;
                 }
             }
-            f0 = q[n - 1];
         }
-        {
-            int[] d = new int[n];
-            int qp = 0;
-            Arrays.fill(ved, false);
-            q[qp++] = f0;
-            ved[f0] = true;
-            for (int i = 0; i < qp; i++) {
-                int cur = q[i];
-                for (int e : g[cur]) {
-                    if (!ved[e]) {
-                        ved[e] = true;
-                        q[qp++] = e;
-                        d[e] = d[cur] + 1;
-                    }
+        f0 = q[n - 1];
+        int[] d = new int[n];
+        qp = 0;
+        Arrays.fill(ved, false);
+        q[qp++] = f0;
+        ved[f0] = true;
+        for (int i = 0; i < qp; i++) {
+            int cur = q[i];
+            for (int e : g[cur]) {
+                if (!ved[e]) {
+                    ved[e] = true;
+                    q[qp++] = e;
+                    d[e] = d[cur] + 1;
                 }
             }
-            f1 = q[n - 1];
-            d01 = d[f1];
         }
+        f1 = q[n - 1];
+        d01 = d[f1];
         return new int[] {d01, f0, f1};
     }