feat: update js solution to lc problem: No.1870

Author: rain84

solution/1800-1899/1870.Minimum Speed to Arrive on Time/README.md

@@ -300,7 +300,7 @@ function arriveOnTime(dist, speed, hour) {
     let res = 0.0;
     let n = dist.length;
     for (let i = 0; i < n; i++) {
-        let cost = parseFloat(dist[i]) / speed;
+        let cost = dist[i] / speed;
         if (i != n - 1) {
             cost = Math.ceil(cost);
         }

solution/1800-1899/1870.Minimum Speed to Arrive on Time/README_EN.md

@@ -245,7 +245,7 @@ function arriveOnTime(dist, speed, hour) {
     let res = 0.0;
     let n = dist.length;
     for (let i = 0; i < n; i++) {
-        let cost = parseFloat(dist[i]) / speed;
+        let cost = dist[i] / speed;
         if (i != n - 1) {
             cost = Math.ceil(cost);
         }

solution/1800-1899/1870.Minimum Speed to Arrive on Time/Solution.js

@@ -22,7 +22,7 @@ function arriveOnTime(dist, speed, hour) {
     let res = 0.0;
     let n = dist.length;
     for (let i = 0; i < n; i++) {
-        let cost = parseFloat(dist[i]) / speed;
+        let cost = dist[i] / speed;
         if (i != n - 1) {
             cost = Math.ceil(cost);
         }