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

Author: thinkasany

solution/0800-0899/0872.Leaf-Similar Trees/README.md

@@ -224,6 +224,24 @@ impl Solution {
 }
 ```
 
+```js
+var leafSimilar = function (root1, root2) {
+    const dfs = root => {
+        if (!root) {
+            return [];
+        }
+        let ans = [...dfs(root.left), ...dfs(root.right)];
+        if (!ans.length) {
+            ans = [root.val];
+        }
+        return ans;
+    };
+    const l1 = dfs(root1);
+    const l2 = dfs(root2);
+    return l1.toString() === l2.toString();
+};
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

solution/0800-0899/0872.Leaf-Similar Trees/README_EN.md

@@ -214,6 +214,24 @@ impl Solution {
 }
 ```
 
+```js
+var leafSimilar = function (root1, root2) {
+    const dfs = root => {
+        if (!root) {
+            return [];
+        }
+        let ans = [...dfs(root.left), ...dfs(root.right)];
+        if (!ans.length) {
+            ans = [root.val];
+        }
+        return ans;
+    };
+    const l1 = dfs(root1);
+    const l2 = dfs(root2);
+    return l1.toString() === l2.toString();
+};
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

solution/0800-0899/0872.Leaf-Similar Trees/Solution.js

@@ -0,0 +1,15 @@
+var leafSimilar = function (root1, root2) {
+    const dfs = root => {
+        if (!root) {
+            return [];
+        }
+        let ans = [...dfs(root.left), ...dfs(root.right)];
+        if (!ans.length) {
+            ans = [root.val];
+        }
+        return ans;
+    };
+    const l1 = dfs(root1);
+    const l2 = dfs(root2);
+    return l1.toString() === l2.toString();
+};