feat: add solutions to lc problem: No.1519 (doocs#904)

No.1519.Number of Nodes in the Sub-Tree With the Same Label

Author: thinkasany

solution/1500-1599/1519.Number of Nodes in the Sub-Tree With the Same Label/README.md

@@ -204,6 +204,33 @@ func countSubTrees(n int, edges [][]int, labels string) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function countSubTrees(n: number, edges: number[][], labels: string): number[] {
+    const dfs = (i: number, fa: number) => {
+        const k = labels.charCodeAt(i) - 97;
+        ans[i] -= cnt[k];
+        cnt[k]++;
+        for (const j of g[i]) {
+            if (j !== fa) {
+                dfs(j, i);
+            }
+        }
+        ans[i] += cnt[k];
+    };
+    const ans = new Array(n).fill(0),
+        cnt = new Array(26).fill(0);
+    const g: number[][] = Array.from({ length: n }, () => []);
+    for (const [a, b] of edges) {
+        g[a].push(b);
+        g[b].push(a);
+    }
+    dfs(0, -1);
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1500-1599/1519.Number of Nodes in the Sub-Tree With the Same Label/README_EN.md

@@ -178,6 +178,33 @@ func countSubTrees(n int, edges [][]int, labels string) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function countSubTrees(n: number, edges: number[][], labels: string): number[] {
+    const dfs = (i: number, fa: number) => {
+        const k = labels.charCodeAt(i) - 97;
+        ans[i] -= cnt[k];
+        cnt[k]++;
+        for (const j of g[i]) {
+            if (j !== fa) {
+                dfs(j, i);
+            }
+        }
+        ans[i] += cnt[k];
+    };
+    const ans = new Array(n).fill(0),
+        cnt = new Array(26).fill(0);
+    const g: number[][] = Array.from({ length: n }, () => []);
+    for (const [a, b] of edges) {
+        g[a].push(b);
+        g[b].push(a);
+    }
+    dfs(0, -1);
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1500-1599/1519.Number of Nodes in the Sub-Tree With the Same Label/Solution.ts

@@ -0,0 +1,22 @@
+function countSubTrees(n: number, edges: number[][], labels: string): number[] {
+    const dfs = (i: number, fa: number) => {
+        const k = labels.charCodeAt(i) - 97;
+        ans[i] -= cnt[k];
+        cnt[k]++;
+        for (const j of g[i]) {
+            if (j !== fa) {
+                dfs(j, i);
+            }
+        }
+        ans[i] += cnt[k];
+    };
+    const ans = new Array(n).fill(0),
+        cnt = new Array(26).fill(0);
+    const g: number[][] = Array.from({ length: n }, () => []);
+    for (const [a, b] of edges) {
+        g[a].push(b);
+        g[b].push(a);
+    }
+    dfs(0, -1);
+    return ans;
+}