Fixed sonar

Author: javadev

src/main/java/g3401_3500/s3453_separate_squares_i/Solution.java

@@ -8,7 +8,7 @@ public double separateSquares(int[][] squares) {
         long lo = 1_000_000_000L;
         for (int[] q : squares) {
             lo = Math.min(lo, q[1]);
-            hi = Math.max(hi, q[1] + q[2]);
+            hi = Math.max(hi, q[1] + (long) q[2]);
         }
         while (lo <= hi) {
             long mid = (lo + hi) / 2;
@@ -20,7 +20,7 @@ public double separateSquares(int[][] squares) {
         }
         double diff1 = diff(hi, squares);
         double diff2 = diff(lo, squares);
-        return (double) hi + diff1 / (diff1 - diff2);
+        return hi + diff1 / (diff1 - diff2);
     }
 
     private double diff(long mid, int[][] squares) {

src/main/java/g3401_3500/s3454_separate_squares_ii/Solution.java

@@ -7,6 +7,7 @@
 import java.util.Arrays;
 import java.util.List;
 
+@SuppressWarnings("java:S1210")
 public class Solution {
     private static class Event implements Comparable<Event> {
         double y;
@@ -65,7 +66,7 @@ void update(int idx, int l, int r, int ql, int qr, int val) {
                 update(2 * idx + 2, mid + 1, r, ql, qr, val);
             }
             if (count[idx] > 0) {
-                len[idx] = x[r + 1] - x[l];
+                len[idx] = x[r + 1] - (double) x[l];
             } else {
                 if (l == r) {
                     len[idx] = 0;