feat: add typescript solution to lc problem: No.2049 (doocs#596)

lc No.2049.Count Nodes With the Highest Score

Author: zhaocchen

solution/2000-2099/2049.Count Nodes With the Highest Score/README.md

@@ -76,6 +76,45 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function countHighestScoreNodes(parents: number[]): number {
+    const n = parents.length;
+    let edge = Array.from({length: n}, (v, i) => ([]));
+    for (let i = 0; i < n; i++) {
+        const parent = parents[i];
+        if (parent != -1) {
+            edge[parent].push(i);
+        }
+    }
+
+    let ans = 0;
+    let max = 0;
+    function dfs(idx: number): number {
+        let size = 1, score = 1;
+        for (let i = 0; i < edge[idx].length; i++) {
+            const child = edge[idx][i];
+            let childSize = dfs(child);
+            size += childSize;
+            score *= childSize;
+        }
+        if (idx > 0) {
+            score *= (n - size);
+        }
+        if (score > max) {
+            max = score;
+            ans = 1;
+        } else if (score == max) {
+            ans++;
+        }
+        return size;
+    }
+    dfs(0);
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/2000-2099/2049.Count Nodes With the Highest Score/README_EN.md

@@ -64,6 +64,45 @@ The highest score is 2, and two nodes (node 0 and node 1) have the highest score
 
 ```
 
+### **TypeScript**
+
+```ts
+function countHighestScoreNodes(parents: number[]): number {
+    const n = parents.length;
+    let edge = Array.from({length: n}, (v, i) => ([]));
+    for (let i = 0; i < n; i++) {
+        const parent = parents[i];
+        if (parent != -1) {
+            edge[parent].push(i);
+        }
+    }
+
+    let ans = 0;
+    let max = 0;
+    function dfs(idx: number): number {
+        let size = 1, score = 1;
+        for (let i = 0; i < edge[idx].length; i++) {
+            const child = edge[idx][i];
+            let childSize = dfs(child);
+            size += childSize;
+            score *= childSize;
+        }
+        if (idx > 0) {
+            score *= (n - size);
+        }
+        if (score > max) {
+            max = score;
+            ans = 1;
+        } else if (score == max) {
+            ans++;
+        }
+        return size;
+    }
+    dfs(0);
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/2000-2099/2049.Count Nodes With the Highest Score/Solution.ts

@@ -0,0 +1,34 @@
+function countHighestScoreNodes(parents: number[]): number {
+    const n = parents.length;
+    let edge = Array.from({length: n}, (v, i) => ([]));
+    for (let i = 0; i < n; i++) {
+        const parent = parents[i];
+        if (parent != -1) {
+            edge[parent].push(i);
+        }
+    }
+
+    let ans = 0;
+    let max = 0;
+    function dfs(idx: number): number {
+        let size = 1, score = 1;
+        for (let i = 0; i < edge[idx].length; i++) {
+            const child = edge[idx][i];
+            let childSize = dfs(child);
+            size += childSize;
+            score *= childSize;
+        }
+        if (idx > 0) {
+            score *= (n - size);
+        }
+        if (score > max) {
+            max = score;
+            ans = 1;
+        } else if (score == max) {
+            ans++;
+        }
+        return size;
+    }
+    dfs(0);
+    return ans;
+};