https://leetcode.cn/problems/find-the-town-judge

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/find-the-town-judge
+
 https://leetcode.cn/problems/buddy-strings
 
 https://leetcode.cn/problems/maximum-frequency-stack

find-the-town-judge/index.ts

@@ -0,0 +1,16 @@
+export default function findJudge(n: number, trust: number[][]): number {
+    const inDegrees = new Array<number>(n + 1).fill(0);
+    const outDegrees = new Array<number>(n + 1).fill(0);
+    for (const edge of trust) {
+        const x = edge[0],
+            y = edge[1];
+        ++inDegrees[y];
+        ++outDegrees[x];
+    }
+    for (let i = 1; i <= n; ++i) {
+        if (inDegrees[i] === n - 1 && outDegrees[i] === 0) {
+            return i;
+        }
+    }
+    return -1;
+}