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

Author: rain84

solution/1100-1199/1110.Delete Nodes And Return Forest/README.md

@@ -348,4 +348,74 @@ var delNodes = function (root, to_delete) {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: BFS
+
+<!-- tabs:start -->
+
+#### 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)
+ *     }
+ * }
+ */
+export function delNodes(root: T, to_delete: number[]): Array<T> {
+    if (!root) return [];
+
+    const del = new Set(to_delete);
+    const res: T[] = [];
+    let q: TreeNode[] = [root];
+
+    while (q.length) {
+        const qNext: TreeNode[] = [];
+
+        for (const node of q) {
+            if (node.left) {
+                qNext.push(node.left);
+
+                if (del.has(node.left.val)) {
+                    node.left = null;
+                }
+            }
+
+            if (node.right) {
+                qNext.push(node.right);
+
+                if (del.has(node.right.val)) {
+                    node.right = null;
+                }
+            }
+
+            if (del.has(node.val)) {
+                if (node.left) res.push(node.left);
+                if (node.right) res.push(node.right);
+            }
+        }
+
+        q = qNext;
+    }
+
+    if (!del.has(root.val)) res.push(root);
+
+    return res;
+}
+
+type T = TreeNode | null;
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/1100-1199/1110.Delete Nodes And Return Forest/README_EN.md

@@ -344,4 +344,74 @@ var delNodes = function (root, to_delete) {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: BFS
+
+<!-- tabs:start -->
+
+#### 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)
+ *     }
+ * }
+ */
+export function delNodes(root: T, to_delete: number[]): Array<T> {
+    if (!root) return [];
+
+    const del = new Set(to_delete);
+    const res: T[] = [];
+    let q: TreeNode[] = [root];
+
+    while (q.length) {
+        const qNext: TreeNode[] = [];
+
+        for (const node of q) {
+            if (node.left) {
+                qNext.push(node.left);
+
+                if (del.has(node.left.val)) {
+                    node.left = null;
+                }
+            }
+
+            if (node.right) {
+                qNext.push(node.right);
+
+                if (del.has(node.right.val)) {
+                    node.right = null;
+                }
+            }
+
+            if (del.has(node.val)) {
+                if (node.left) res.push(node.left);
+                if (node.right) res.push(node.right);
+            }
+        }
+
+        q = qNext;
+    }
+
+    if (!del.has(root.val)) res.push(root);
+
+    return res;
+}
+
+type T = TreeNode | null;
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/1100-1199/1110.Delete Nodes And Return Forest/Solution2.ts

@@ -0,0 +1,55 @@
+/**
+ * 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)
+ *     }
+ * }
+ */
+export function delNodes(root: T, to_delete: number[]): Array<T> {
+    if (!root) return [];
+
+    const del = new Set(to_delete);
+    const res: T[] = [];
+    let q: TreeNode[] = [root];
+
+    while (q.length) {
+        const qNext: TreeNode[] = [];
+
+        for (const node of q) {
+            if (node.left) {
+                qNext.push(node.left);
+
+                if (del.has(node.left.val)) {
+                    node.left = null;
+                }
+            }
+
+            if (node.right) {
+                qNext.push(node.right);
+
+                if (del.has(node.right.val)) {
+                    node.right = null;
+                }
+            }
+
+            if (del.has(node.val)) {
+                if (node.left) res.push(node.left);
+                if (node.right) res.push(node.right);
+            }
+        }
+
+        q = qNext;
+    }
+
+    if (!del.has(root.val)) res.push(root);
+
+    return res;
+}
+
+type T = TreeNode | null;