We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 5f66918 commit 190798fCopy full SHA for 190798f
solution/2900-2999/2924.Find Champion II/README.md
@@ -229,12 +229,10 @@ function findChampion(n: number, edges: number[][]): number {
229
230
```js
231
function findChampion(n, edges) {
232
- const vertexes = new Set() < number > Array.from({ length: n }, (_, i) => i);
233
-
+ const vertexes = new Set(Array.from({ length: n }, (_, i) => i));
234
for (const [_, v] of edges) {
235
vertexes.delete(v);
236
}
237
238
return vertexes.size === 1 ? vertexes[Symbol.iterator]().next().value : -1;
239
240
```
0 commit comments