feat: add js solution to lc problem: No.0187. Repeated DNA Sequences (doocs#396)

Author: zhaocchen

solution/0100-0199/0187.Repeated DNA Sequences/README.md

@@ -82,6 +82,28 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {string} s
+ * @return {string[]}
+ */
+var findRepeatedDnaSequences = function(s) {
+    let n = 10;
+    let subs = new Set();
+    let res = new Set();
+    for (let i = 0; i < s.length - n + 1; i++) {
+        let sub = s.slice(i, i + n);
+        if (subs.has(sub)) {
+            res.add(sub);
+        }
+        subs.add(sub);
+    }
+    return [...res];
+};
+```
+
 ### **...**
 
 ```

solution/0100-0199/0187.Repeated DNA Sequences/README_EN.md

@@ -71,6 +71,28 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {string} s
+ * @return {string[]}
+ */
+var findRepeatedDnaSequences = function(s) {
+    let n = 10;
+    let subs = new Set();
+    let res = new Set();
+    for (let i = 0; i < s.length - n + 1; i++) {
+        let sub = s.slice(i, i + n);
+        if (subs.has(sub)) {
+            res.add(sub);
+        }
+        subs.add(sub);
+    }
+    return [...res];
+};
+```
+
 ### **...**
 
 ```

solution/0100-0199/0187.Repeated DNA Sequences/Solution.js

@@ -0,0 +1,17 @@
+/**
+ * @param {string} s
+ * @return {string[]}
+ */
+ var findRepeatedDnaSequences = function(s) {
+    let n = 10;
+    let subs = new Set();
+    let res = new Set();
+    for (let i = 0; i < s.length - n + 1; i++) {
+        let sub = s.slice(i, i + n);
+        if (subs.has(sub)) {
+            res.add(sub);
+        }
+        subs.add(sub);
+    }
+    return [...res];
+};