Fixed sonar

Author: javadev

src/main/java/g3401_3500/s3484_design_spreadsheet/Spreadsheet.java

@@ -7,16 +7,16 @@
 
 @SuppressWarnings("unused")
 public class Spreadsheet {
-    private final Map<String, Integer> spreadsheet = new HashMap<>();
+    private final Map<String, Integer> data = new HashMap<>();
 
     public Spreadsheet(int rows) {}
 
     public void setCell(String cell, int value) {
-        spreadsheet.put(cell, value);
+        data.put(cell, value);
     }
 
     public void resetCell(String cell) {
-        spreadsheet.put(cell, 0);
+        data.put(cell, 0);
     }
 
     public int getValue(String formula) {
@@ -25,11 +25,11 @@ public int getValue(String formula) {
         String right = formula.substring(index + 1);
         int x =
                 Character.isLetter(left.charAt(0))
-                        ? spreadsheet.getOrDefault(left, 0)
+                        ? data.getOrDefault(left, 0)
                         : Integer.parseInt(left);
         int y =
                 Character.isLetter(right.charAt(0))
-                        ? spreadsheet.getOrDefault(right, 0)
+                        ? data.getOrDefault(right, 0)
                         : Integer.parseInt(right);
         return x + y;
     }

src/main/java/g3401_3500/s3486_longest_special_path_ii/Solution.java

@@ -6,8 +6,7 @@
 import java.util.List;
 
 public class Solution {
-    private int n;
-    private final int maxVal = 50000;
+    private final static int MAX_VAL = 50000;
     private int dupCount;
     private int overCount;
     private long ansLength;
@@ -19,7 +18,7 @@ public class Solution {
     private int[] freq;
 
     public int[] longestSpecialPath(int[][] edges, int[] nums) {
-        this.n = nums.length;
+        int n = nums.length;
         this.nums = nums;
         adj = new ArrayList<>();
         for (int i = 0; i < n; i++) {
@@ -36,7 +35,7 @@ public int[] longestSpecialPath(int[][] edges, int[] nums) {
         // Preallocate DFS chain arrays
         path = new int[n];
         dist = new long[n];
-        freq = new int[maxVal + 1];
+        freq = new int[MAX_VAL + 1];
         ansLength = 0;
         ansNodes = Integer.MAX_VALUE;
         dupCount = 0;