feat: add javascript solution to lcof problem: No.35

lcof/面试题35. 复杂链表的复制/README.md

@@ -267,6 +267,52 @@ public class Solution {
 
 ### **JavaScript**
 
+- 哈希表
+
+```js
+/**
+ * // Definition for a Node.
+ * function Node(val, next, random) {
+ *    this.val = val;
+ *    this.next = next;
+ *    this.random = random;
+ * };
+ */
+
+/**
+ * @param {Node} head
+ * @return {Node}
+ */
+var copyRandomList = function (head) {
+     if (head == null) {
+        return head
+    }
+
+    let cur = head
+    const map = new Map();
+    while (cur != null) {
+        map.set(cur, new Node(cur.val))
+        cur = cur.next
+    }
+
+    const res = new Node();
+    let newCur = res
+    cur = head
+    while (cur != null) {
+        const node = map.get(cur)
+        node.random = map.get(cur.random)
+        newCur.next = node
+        newCur = node
+        cur = cur.next
+    }
+
+    return res.next
+};
+
+```
+
+- 原地算法
+
 ```js
 /**
  * // Definition for a Node.