feat: add typescript solution to lc problem: No.0997.Find the Town Judge

Author: zhaocchen

solution/0900-0999/0997.Find the Town Judge/README.md

@@ -101,6 +101,27 @@ class Solution:
 
 ```
 
+### **TypeScript**
+
+```ts
+function findJudge(n: number, trust: number[][]): number {
+    let candidates = new Array(n).fill(0);
+    for (let [a, b] of trust) {
+        candidates[a - 1] = -1;
+        if (candidates[b - 1] >= 0) {
+            candidates[b - 1]++;
+        }
+    }
+    
+    for (let i = 0; i < n; i++) {
+        if (candidates[i] == n - 1) {
+            return i + 1;
+        }
+    }
+    return -1;
+};
+```
+
 ### **...**
 
 ```

solution/0900-0999/0997.Find the Town Judge/README_EN.md

@@ -108,6 +108,27 @@ class Solution:
 
 ```
 
+### **TypeScript**
+
+```ts
+function findJudge(n: number, trust: number[][]): number {
+    let candidates = new Array(n).fill(0);
+    for (let [a, b] of trust) {
+        candidates[a - 1] = -1;
+        if (candidates[b - 1] >= 0) {
+            candidates[b - 1]++;
+        }
+    }
+    
+    for (let i = 0; i < n; i++) {
+        if (candidates[i] == n - 1) {
+            return i + 1;
+        }
+    }
+    return -1;
+};
+```
+
 ### **...**
 
 ```

solution/0900-0999/0997.Find the Town Judge/Solution.ts

@@ -0,0 +1,16 @@
+function findJudge(n: number, trust: number[][]): number {
+    let candidates = new Array(n).fill(0);
+    for (let [a, b] of trust) {
+        candidates[a - 1] = -1;
+        if (candidates[b - 1] >= 0) {
+            candidates[b - 1]++;
+        }
+    }
+    
+    for (let i = 0; i < n; i++) {
+        if (candidates[i] == n - 1) {
+            return i + 1;
+        }
+    }
+    return -1;
+};