Solution to today's problem

spannm · Jul 1, 2024 · 60fd6d8 · 60fd6d8
1 parent 4aa18b2
commit 60fd6d8
Showing 1 changed file with 3 additions and 3 deletions.
diff --git a/src/main/java/io/github/spannm/leetcode/lc1/lc1500/Problem1579.java b/src/main/java/io/github/spannm/leetcode/lc1/lc1500/Problem1579.java
@@ -8,9 +8,9 @@
  */
 class Problem1579 extends LeetcodeProblem {
 
-    int maxNumEdgesToRemove(final int _n, final int[][] _edges) {
-        final int[] rootA = new int[_n + 1];
-        final int[] rootB = new int[_n + 1];
+    int maxNumEdgesToRemove(int _n, int[][] _edges) {
+        int[] rootA = new int[_n + 1];
+        int[] rootB = new int[_n + 1];
         for (int i = 1; i <= _n; i++) {
             rootA[i] = i;
             rootB[i] = i;