feat: add solutions to lcp problem: No.62

Author: thinkasany

lcp/LCP 62. 交通枢纽/README.md

@@ -155,6 +155,28 @@ func transportationHub(path [][]int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function transportationHub(path: number[][]): number {
+    const ind: number[] = new Array(1001).fill(0);
+    const outd: number[] = new Array(1001).fill(0);
+    const s: Set<number> = new Set();
+    for (const [a, b] of path) {
+        s.add(a);
+        s.add(b);
+        ind[b]++;
+        outd[a]++;
+    }
+    for (const c of s) {
+        if (ind[c] === s.size - 1 && outd[c] === 0) {
+            return c;
+        }
+    }
+    return -1;
+}
+```
+
 ### **...**
 
 ```

lcp/LCP 62. 交通枢纽/Solution.ts

@@ -0,0 +1,17 @@
+function transportationHub(path: number[][]): number {
+    const ind: number[] = new Array(1001).fill(0);
+    const outd: number[] = new Array(1001).fill(0);
+    const s: Set<number> = new Set();
+    for (const [a, b] of path) {
+        s.add(a);
+        s.add(b);
+        ind[b]++;
+        outd[a]++;
+    }
+    for (const c of s) {
+        if (ind[c] === s.size - 1 && outd[c] === 0) {
+            return c;
+        }
+    }
+    return -1;
+}