Solution to today's problem

Author: spannm

src/main/java/io/github/spannm/leetcode/lc1/lc1700/Problem1791.java

@@ -5,15 +5,16 @@
 class Problem1791 extends LeetcodeProblem {
 
     int findCenter(int[][] _edges) {
-        int[] neighbors = new int[_edges.length + 1];
+        int count = _edges.length;
+        int[] neighbors = new int[count + 1];
         for (int[] edge : _edges) {
             int a = edge[0];
             int b = edge[1];
             neighbors[a - 1]++;
             neighbors[b - 1]++;
         }
         for (int i = 0; i < neighbors.length; i++) {
-            if (neighbors[i] == _edges.length) {
+            if (neighbors[i] == count) {
                 return i + 1;
             }
         }