Fixed sonar warnings.

Author: javadev

src/main/java/g1901_2000/s1912_design_movie_rental_system/MovieRentingSystem.java

@@ -11,9 +11,9 @@
 import java.util.List;
 import java.util.TreeSet;
 
+@SuppressWarnings("java:S1172")
 public class MovieRentingSystem {
-
- static class Point {
+ private static class Point {
  int movie;
  int shop;
  int price;
@@ -25,10 +25,9 @@ public Point(int movie, int shop, int price) {
  }
  }
 
- HashMap<Integer, TreeSet<Point>> unrentedMovies = new HashMap<>();
- HashMap<String, Integer> shopMovieToPrice = new HashMap<>();
-
- Comparator<Point> comparator =
+ private HashMap<Integer, TreeSet<Point>> unrentedMovies = new HashMap<>();
+ private HashMap<String, Integer> shopMovieToPrice = new HashMap<>();
+ private Comparator<Point> comparator =
  (o1, o2) -> {
  if (o1.price != o2.price) {
  return Integer.compare(o1.price, o2.price);
@@ -38,18 +37,14 @@ public Point(int movie, int shop, int price) {
  return Integer.compare(o1.movie, o2.movie);
  }
  };
-
- TreeSet<Point> rented = new TreeSet<>(comparator);
+ private TreeSet<Point> rented = new TreeSet<>(comparator);
 
  public MovieRentingSystem(int n, int[][] entries) {
-
  for (int[] entry : entries) {
  int shop = entry[0];
  int movie = entry[1];
  int price = entry[2];
-
  unrentedMovies.putIfAbsent(movie, new TreeSet<>(comparator));
-
  unrentedMovies.get(movie).add(new Point(movie, shop, price));
  shopMovieToPrice.put(shop + "+" + movie, price);
  }

src/main/java/g1901_2000/s1923_longest_common_subpath/Solution.java

@@ -2,7 +2,8 @@
 
 import java.util.HashSet;
 
-class Solution {
+@SuppressWarnings("java:S1172")
+public class Solution {
  private static final long BASE = 100001;
  private static final long MOD = (long) (Math.pow(10, 11) + 7);
  private long[] pow;
@@ -15,23 +16,19 @@ public int longestCommonSubpath(int n, int[][] paths) {
  }
  pow = new long[min + 1];
  pow[0]++;
-
  for (int i = 1; i <= min; i++) {
  pow[i] = (pow[i - 1] * BASE) % MOD;
  }
-
  int st = 1;
  int end = min;
  int mid = (st + end) / 2;
-
  while (st <= end) {
  if (commonSubstring(paths, mid)) {
  res = mid;
  st = mid + 1;
  } else {
  end = mid - 1;
  }
-
  mid = (st + end) / 2;
  }
  return res;
@@ -51,17 +48,14 @@ private boolean commonSubstring(int[][] paths, int l) {
  private HashSet<Long> rollingHash(int[] a, int l) {
  HashSet<Long> set = new HashSet<>();
  long hash = 0;
-
  for (int i = 0; i < l; i++) {
  hash = (hash * BASE + a[i]) % MOD;
  }
  set.add(hash);
-
  for (int n = a.length, curr = l, prev = 0; curr < n; prev++, curr++) {
  hash = (((hash * BASE) % MOD - (a[prev] * pow[l]) % MOD + a[curr]) + MOD) % MOD;
  set.add(hash);
  }
-
  return set;
  }
 }