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

Author: rain84

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

@@ -298,6 +298,52 @@ function delNodes(root: TreeNode | null, to_delete: number[]): Array<TreeNode |
 }
 ```
 
+#### JavaScript
+
+```js
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @param {number[]} to_delete
+ * @return {TreeNode[]}
+ */
+var delNodes = function (root, to_delete) {
+    const s = Array(1001).fill(false);
+    for (const x of to_delete) {
+        s[x] = true;
+    }
+    const ans = [];
+    const dfs = root => {
+        if (!root) {
+            return null;
+        }
+        root.left = dfs(root.left);
+        root.right = dfs(root.right);
+        if (!s[root.val]) {
+            return root;
+        }
+        if (root.left) {
+            ans.push(root.left);
+        }
+        if (root.right) {
+            ans.push(root.right);
+        }
+        return null;
+    };
+    if (dfs(root)) {
+        ans.push(root);
+    }
+    return ans;
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -294,6 +294,52 @@ function delNodes(root: TreeNode | null, to_delete: number[]): Array<TreeNode |
 }
 ```
 
+#### JavaScript
+
+```js
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @param {number[]} to_delete
+ * @return {TreeNode[]}
+ */
+var delNodes = function (root, to_delete) {
+    const s = Array(1001).fill(false);
+    for (const x of to_delete) {
+        s[x] = true;
+    }
+    const ans = [];
+    const dfs = root => {
+        if (!root) {
+            return null;
+        }
+        root.left = dfs(root.left);
+        root.right = dfs(root.right);
+        if (!s[root.val]) {
+            return root;
+        }
+        if (root.left) {
+            ans.push(root.left);
+        }
+        if (root.right) {
+            ans.push(root.right);
+        }
+        return null;
+    };
+    if (dfs(root)) {
+        ans.push(root);
+    }
+    return ans;
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1100-1199/1110.Delete Nodes And Return Forest/Solution.js

@@ -0,0 +1,41 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @param {number[]} to_delete
+ * @return {TreeNode[]}
+ */
+var delNodes = function (root, to_delete) {
+    const s = Array(1001).fill(false);
+    for (const x of to_delete) {
+        s[x] = true;
+    }
+    const ans = [];
+    const dfs = root => {
+        if (!root) {
+            return null;
+        }
+        root.left = dfs(root.left);
+        root.right = dfs(root.right);
+        if (!s[root.val]) {
+            return root;
+        }
+        if (root.left) {
+            ans.push(root.left);
+        }
+        if (root.right) {
+            ans.push(root.right);
+        }
+        return null;
+    };
+    if (dfs(root)) {
+        ans.push(root);
+    }
+    return ans;
+};