Solution to today's problem

Author: spannm

src/main/java/io/github/spannm/leetcode/lc2/lc2200/Problem2285.java

@@ -9,18 +9,18 @@
  */
 class Problem2285 extends LeetcodeProblem {
 
-    long maximumImportance(int n, int[][] roads) {
-        int[] deg = new int[n];
-        for (int[] r : roads) {
+    long maximumImportance(int _nbCities, int[][] _roads) {
+        int[] deg = new int[_nbCities];
+        for (int[] r : _roads) {
             deg[r[0]]++;
             deg[r[1]]++;
         }
         Arrays.sort(deg);
-        long ans = 0;
-        for (int i = 0; i < n; i++) {
-            ans += (long) (i + 1) * deg[i];
+        long result = 0;
+        for (int i = 0; i < _nbCities; i++) {
+            result += (long) (i + 1) * deg[i];
         }
-        return ans;
+        return result;
     }
 
 }