feat: add js solution to lc problem: No.1921.Eliminate Maximum Number of Monsters (doocs#500)

zhaocchen · web-flow · commit 5bbdd4446e91 · 2021-07-05T07:51:59.000+08:00
diff --git a/solution/1900-1999/1921.Eliminate Maximum Number of Monsters/README.md b/solution/1900-1999/1921.Eliminate Maximum Number of Monsters/README.md
@@ -108,6 +108,29 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} dist
+ * @param {number[]} speed
+ * @return {number}
+ */
+ var eliminateMaximum = function(dist, speed) {
+    let arr = [];
+    for (let i = 0; i < dist.length; i++) {
+        arr[i] = dist[i] / speed[i];
+    }
+    arr.sort((a, b) => a - b);
+    let ans = 0;
+    while (arr[0] > ans) {
+        arr.shift();
+        ++ans;
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp
diff --git a/solution/1900-1999/1921.Eliminate Maximum Number of Monsters/README_EN.md b/solution/1900-1999/1921.Eliminate Maximum Number of Monsters/README_EN.md
@@ -96,6 +96,29 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} dist
+ * @param {number[]} speed
+ * @return {number}
+ */
+ var eliminateMaximum = function(dist, speed) {
+    let arr = [];
+    for (let i = 0; i < dist.length; i++) {
+        arr[i] = dist[i] / speed[i];
+    }
+    arr.sort((a, b) => a - b);
+    let ans = 0;
+    while (arr[0] > ans) {
+        arr.shift();
+        ++ans;
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp
diff --git a/solution/1900-1999/1921.Eliminate Maximum Number of Monsters/Solution.js b/solution/1900-1999/1921.Eliminate Maximum Number of Monsters/Solution.js
@@ -0,0 +1,18 @@
+/**
+ * @param {number[]} dist
+ * @param {number[]} speed
+ * @return {number}
+ */
+ var eliminateMaximum = function(dist, speed) {
+    let arr = [];
+    for (let i = 0; i < dist.length; i++) {
+        arr[i] = dist[i] / speed[i];
+    }
+    arr.sort((a, b) => a - b);
+    let ans = 0;
+    while (arr[0] > ans) {
+        arr.shift();
+        ++ans;
+    }
+    return ans;
+};
