feat: add solutions to lc problem: No.2924

solution/2900-2999/2924.Find Champion II/README.md

@@ -182,6 +182,61 @@ function findChampion(n: number, edges: number[][]): number {
 }
 ```
 
+#### JavaScript
+
+```js
+function findChampion(n, edges) {
+    const indeg = Array(n).fill(0);
+    for (const [_, v] of edges) {
+        ++indeg[v];
+    }
+    let [ans, cnt] = [-1, 0];
+    for (let i = 0; i < n; ++i) {
+        if (indeg[i] === 0) {
+            ++cnt;
+            ans = i;
+        }
+    }
+    return cnt === 1 ? ans : -1;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- solution:start -->
+
+### 方法二
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function findChampion(n: number, edges: number[][]): number {
+    const vertexes = new Set<number>(Array.from({ length: n }, (_, i) => i));
+
+    for (const [_, v] of edges) {
+        vertexes.delete(v);
+    }
+
+    return vertexes.size === 1 ? vertexes[Symbol.iterator]().next().value! : -1;
+}
+```
+
+#### JavaScript
+
+```js
+function findChampion(n, edges) {
+    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;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2900-2999/2924.Find Champion II/README_EN.md

@@ -180,6 +180,61 @@ function findChampion(n: number, edges: number[][]): number {
 }
 ```
 
+#### JavaScript
+
+```js
+function findChampion(n, edges) {
+    const indeg = Array(n).fill(0);
+    for (const [_, v] of edges) {
+        ++indeg[v];
+    }
+    let [ans, cnt] = [-1, 0];
+    for (let i = 0; i < n; ++i) {
+        if (indeg[i] === 0) {
+            ++cnt;
+            ans = i;
+        }
+    }
+    return cnt === 1 ? ans : -1;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- solution:start -->
+
+### Solution 2
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function findChampion(n: number, edges: number[][]): number {
+    const vertexes = new Set<number>(Array.from({ length: n }, (_, i) => i));
+
+    for (const [_, v] of edges) {
+        vertexes.delete(v);
+    }
+
+    return vertexes.size === 1 ? vertexes[Symbol.iterator]().next().value! : -1;
+}
+```
+
+#### JavaScript
+
+```js
+function findChampion(n, edges) {
+    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;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -0,0 +1,14 @@
+function findChampion(n, edges) {
+    const indeg = Array(n).fill(0);
+    for (const [_, v] of edges) {
+        ++indeg[v];
+    }
+    let [ans, cnt] = [-1, 0];
+    for (let i = 0; i < n; ++i) {
+        if (indeg[i] === 0) {
+            ++cnt;
+            ans = i;
+        }
+    }
+    return cnt === 1 ? ans : -1;
+}

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

@@ -0,0 +1,7 @@
+function findChampion(n, edges) {
+    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;
+}

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

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