Update Solution.java

javadev · web-flow · commit 0be3714160ec · 2025-01-14T06:31:15.000+02:00
diff --git a/src/main/java/g3401_3500/s3419_minimize_the_maximum_edge_weight_of_graph/Solution.java b/src/main/java/g3401_3500/s3419_minimize_the_maximum_edge_weight_of_graph/Solution.java
@@ -24,7 +24,7 @@ public int minMaxWeight(int n, int[][] edges, int threshold) {
         int[] distance = new int[n];
         Arrays.fill(distance, Integer.MAX_VALUE);
         distance[0] = 0;
-        if (reversedG[0].size().isEmpty()) {
+        if (reversedG[0].isEmpty()) {
             return -1;
         }
         Queue<Integer> que = new LinkedList<>();

Original file line number	Diff line number	Diff line change
`@@ -24,7 +24,7 @@ public int minMaxWeight(int n, int[][] edges, int threshold) {`
`24`	`24`	`int[] distance = new int[n];`
`25`	`25`	`Arrays.fill(distance, Integer.MAX_VALUE);`
`26`	`26`	`distance[0] = 0;`
`27`		`- if (reversedG[0].size().isEmpty()) {`
	`27`	`+ if (reversedG[0].isEmpty()) {`
`28`	`28`	`return -1;`
`29`	`29`	`}`
`30`	`30`	`Queue<Integer> que = new LinkedList<>();`