Fixed sonar

Author: javadev

src/main/java/g3201_3300/s3232_find_if_digit_game_can_be_won/Solution.java

@@ -4,7 +4,6 @@
 
 public class Solution {
     public boolean canAliceWin(int[] nums) {
-        int n = nums.length;
         int sdSum = 0;
         int ddSum = 0;
         for (int num : nums) {

src/main/java/g3201_3300/s3233_find_the_count_of_numbers_which_are_not_special/Solution.java

@@ -10,7 +10,7 @@ public int nonSpecialCount(int l, int r) {
         List<Integer> primes = sieveOfEratosthenes((int) Math.sqrt(r));
         int specialCount = 0;
 
-        for (int prime : primes) {
+        for (Integer prime : primes) {
             long primeSquare = (long) prime * prime;
             if (primeSquare >= l && primeSquare <= r) {
                 specialCount++;

src/main/java/g3201_3300/s3235_check_if_the_rectangle_corner_is_reachable/Solution.java

@@ -5,6 +5,7 @@
 
 import java.util.Arrays;
 
+@SuppressWarnings("java:S135")
 public class Solution {
     public boolean canReachCorner(int x, int y, int[][] circles) {
         int n = circles.length;
@@ -58,7 +59,7 @@ public boolean canReachCorner(int x, int y, int[][] circles) {
                 int x2 = circles[j][0];
                 int y2 = circles[j][1];
                 int r2 = circles[j][2];
-                double dist = Math.sqrt(Math.pow(x1 - x2, 2) + Math.pow(y1 - y2, 2));
+                double dist = Math.sqrt(Math.pow(x1 - x2, 2.0) + Math.pow(y1 - y2, 2.0));
                 if (dist <= (r1 + r2)) {
                     ds.dsu(i, j);
                 }
@@ -91,7 +92,8 @@ public int findUpar(int u) {
             if (u == parent[u]) {
                 return u;
             }
-            return parent[u] = findUpar(parent[u]);
+            parent[u] = findUpar(parent[u]);
+            return parent[u];
         }
 
         public void dsu(int u, int v) {