Fixed sonar

Author: javadev

src/main/java/g3401_3500/s3419_minimize_the_maximum_edge_weight_of_graph/Solution.java

@@ -10,7 +10,6 @@
 
 @SuppressWarnings({"unchecked", "unused", "java:S1172"})
 public class Solution {
-    private ArrayList<ArrayList<Pair>> adj;
     private ArrayList<ArrayList<Pair>> revadj;
 
     private static class Pair {
@@ -24,7 +23,7 @@ public Pair(int node, int weight) {
     }
 
     public int minMaxWeight(int n, int[][] edges, int threshold) {
-        adj = new ArrayList<>();
+        ArrayList<ArrayList<Pair>> adj = new ArrayList<>();
         revadj = new ArrayList<>();
         for (int i = 0; i <= n + 1; i++) {
             adj.add(new ArrayList<>());
@@ -45,7 +44,7 @@ public int minMaxWeight(int n, int[][] edges, int threshold) {
         dist[0] = 0;
         Queue<Pair> q = new LinkedList<>();
         q.offer(new Pair(0, 0));
-        while (q.size() > 0) {
+        while (!q.isEmpty()) {
             int u = q.peek().node;
             int currMax = q.peek().weight;
             q.poll();