Day65

swolecoder · swolecoder · commit 8ed0e6f3bc4b · 2020-12-16T00:49:56.000-05:00
diff --git a/Day65/index.js b/Day65/index.js
@@ -0,0 +1,32 @@
+/**
+ * // Definition for a Node.
+ * function Node(val, left, right, random) {
+ *    this.val = val === undefined ? null : val;
+ *    this.left = left === undefined ? null : left;
+ *    this.right = right === undefined ? null : right;
+ *    this.random = random === undefined ? null : random;
+ * };
+ */
+
+/**
+ * @param {Node} root
+ * @return {NodeCopy}
+ */
+var copyRandomBinaryTree = function (root) {
+    let map = new Map();
+
+    function dfs(node) {
+        if (!node) return null;
+        if (map.has(node)) return map.get(node);
+
+        let d = new NodeCopy(node.val);
+        map.set(node, d);
+        d.left = dfs(node.left)
+        d.right = dfs(node.right)
+        d.random = dfs(node.random)
+        return d;
+
+    }
+
+    return dfs(root)
+};
diff --git a/Extra/mergeSort.js b/Extra/mergeSort.js
@@ -0,0 +1,25 @@
+const merge = (left, right) => {
+    let res = [];
+    while (left.length && right.length) {
+        if (left[0] < right[0]) {
+            res.push(left.shift())
+        } else {
+            res.push(right.shift())
+        }
+    }
+
+    return [...res, ...left, ...right]
+}
+
+
+const mergeSort = arr => {
+    if (arr.length <= 1) return arr;
+    let mid = Math.floor(arr.length / 2),
+        left = mergeSort(arr.slice(0, mid)),
+        right = mergeSort(arr.slice(mid));
+
+    return merge(left, right);
+};
+
+
+console.log(mergeSort([15, 13, 2, 1]))
diff --git a/README.md b/README.md
@@ -145,4 +145,6 @@ If you are loving solving problems in leetcode, please contact me to enjoy it to
 
 |Day 63| [131. Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) | [javascript]()|[:memo:](https://leetcode.com/problems/palindrome-partitioning/)|Medium|
 
-|Day 64| [131. Palindrome Partitioning](https://leetcode.com/problems/squares-of-a-sorted-array/) | [javascript]()|[:memo:](https://leetcode.com/problems/squares-of-a-sorted-array/)|Easy|
+|Day 64| [131. Palindrome Partitioning](https://leetcode.com/problems/squares-of-a-sorted-array/) | [javascript]()|[:memo:](https://leetcode.com/problems/squares-of-a-sorted-array/)|Easy|
+
+|Day 65| [1485. Clone Binary Tree With Random Pointer](https://leetcode.com/problems/clone-binary-tree-with-random-pointer/) | [javascript]()|[:memo:](https://leetcode.com/problems/clone-binary-tree-with-random-pointer/)|Medium|
