Update Solution2.js

Author: yanglbme

solution/2900-2999/2924.Find Champion II/Solution2.js

@@ -1,9 +1,7 @@
 function findChampion(n, edges) {
-    const vertexes = new Set() < number > Array.from({ length: n }, (_, i) => i);
-
+    const vertexes = new Set(Array.from({ length: n }, (_, i) => i));
     for (const [_, v] of edges) {
         vertexes.delete(v);
     }
-
     return vertexes.size === 1 ? vertexes[Symbol.iterator]().next().value : -1;
 }