feat: add ts solution to lc problem: No.2385

No.2385.Amount of Time for Binary Tree to Be Infected

Author: YangFong

solution/2300-2399/2385.Amount of Time for Binary Tree to Be Infected/README.md

@@ -276,7 +276,46 @@ func amountOfTime(root *TreeNode, start int) int {
 ### **TypeScript**
 
 ```ts
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
 
+function amountOfTime(root: TreeNode | null, start: number): number {
+    const map = new Map<number, number[]>();
+    const create = ({ val, left, right }: TreeNode) => {
+        if (left != null) {
+            map.set(val, [...(map.get(val) ?? []), left.val]);
+            map.set(left.val, [...(map.get(left.val) ?? []), val]);
+            create(left);
+        }
+        if (right != null) {
+            map.set(val, [...(map.get(val) ?? []), right.val]);
+            map.set(right.val, [...(map.get(right.val) ?? []), val]);
+            create(right);
+        }
+    };
+    create(root);
+    const dfs = (st: number, fa: number) => {
+        let res = 0;
+        for (const v of map.get(st) ?? []) {
+            if (v !== fa) {
+                res = Math.max(res, dfs(v, st) + 1);
+            }
+        }
+        return res;
+    };
+    return dfs(start, -1);
+}
 ```
 
 ### **...**

solution/2300-2399/2385.Amount of Time for Binary Tree to Be Infected/README_EN.md

@@ -262,7 +262,46 @@ func amountOfTime(root *TreeNode, start int) int {
 ### **TypeScript**
 
 ```ts
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
 
+function amountOfTime(root: TreeNode | null, start: number): number {
+    const map = new Map<number, number[]>();
+    const create = ({ val, left, right }: TreeNode) => {
+        if (left != null) {
+            map.set(val, [...(map.get(val) ?? []), left.val]);
+            map.set(left.val, [...(map.get(left.val) ?? []), val]);
+            create(left);
+        }
+        if (right != null) {
+            map.set(val, [...(map.get(val) ?? []), right.val]);
+            map.set(right.val, [...(map.get(right.val) ?? []), val]);
+            create(right);
+        }
+    };
+    create(root);
+    const dfs = (st: number, fa: number) => {
+        let res = 0;
+        for (const v of map.get(st) ?? []) {
+            if (v !== fa) {
+                res = Math.max(res, dfs(v, st) + 1);
+            }
+        }
+        return res;
+    };
+    return dfs(start, -1);
+}
 ```
 
 ### **...**

solution/2300-2399/2385.Amount of Time for Binary Tree to Be Infected/Solution.ts

@@ -0,0 +1,40 @@
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
+
+function amountOfTime(root: TreeNode | null, start: number): number {
+    const map = new Map<number, number[]>();
+    const create = ({ val, left, right }: TreeNode) => {
+        if (left != null) {
+            map.set(val, [...(map.get(val) ?? []), left.val]);
+            map.set(left.val, [...(map.get(left.val) ?? []), val]);
+            create(left);
+        }
+        if (right != null) {
+            map.set(val, [...(map.get(val) ?? []), right.val]);
+            map.set(right.val, [...(map.get(right.val) ?? []), val]);
+            create(right);
+        }
+    };
+    create(root);
+    const dfs = (st: number, fa: number) => {
+        let res = 0;
+        for (const v of map.get(st) ?? []) {
+            if (v !== fa) {
+                res = Math.max(res, dfs(v, st) + 1);
+            }
+        }
+        return res;
+    };
+    return dfs(start, -1);
+}