feat: add ts solution to lc problem: No.1870

Author: rain84

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

@@ -310,6 +310,37 @@ function arriveOnTime(dist, speed, hour) {
 }
 ```
 
+#### TypeScript
+
+```ts
+function minSpeedOnTime(dist: number[], hour: number): number {
+    if (dist.length > Math.ceil(hour)) return -1;
+
+    const check = (speed: number) => {
+        const n = dist.length;
+        let time = 0;
+
+        for (let i = 0; i < n; i++) {
+            const t = dist[i] / speed;
+            time += i === n - 1 ? t : Math.ceil(t);
+        }
+
+        return hour >= time;
+    };
+
+    const max = 10 ** 7;
+    let [l, r] = [1, max];
+
+    while (l <= r) {
+        const i = (l + r) >> 1;
+        if (check(i)) r = i - 1;
+        else l = i + 1;
+    }
+
+    return l <= max ? l : -1;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -255,6 +255,37 @@ function arriveOnTime(dist, speed, hour) {
 }
 ```
 
+#### TypeScript
+
+```ts
+function minSpeedOnTime(dist: number[], hour: number): number {
+    if (dist.length > Math.ceil(hour)) return -1;
+
+    const check = (speed: number) => {
+        const n = dist.length;
+        let time = 0;
+
+        for (let i = 0; i < n; i++) {
+            const t = dist[i] / speed;
+            time += i === n - 1 ? t : Math.ceil(t);
+        }
+
+        return hour >= time;
+    };
+
+    const max = 10 ** 7;
+    let [l, r] = [1, max];
+
+    while (l <= r) {
+        const i = (l + r) >> 1;
+        if (check(i)) r = i - 1;
+        else l = i + 1;
+    }
+
+    return l <= max ? l : -1;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -0,0 +1,26 @@
+function minSpeedOnTime(dist: number[], hour: number): number {
+    if (dist.length > Math.ceil(hour)) return -1;
+
+    const check = (speed: number) => {
+        const n = dist.length;
+        let time = 0;
+
+        for (let i = 0; i < n; i++) {
+            const t = dist[i] / speed;
+            time += i === n - 1 ? t : Math.ceil(t);
+        }
+
+        return hour >= time;
+    };
+
+    const max = 10 ** 7;
+    let [l, r] = [1, max];
+
+    while (l <= r) {
+        const i = (l + r) >> 1;
+        if (check(i)) r = i - 1;
+        else l = i + 1;
+    }
+
+    return l <= max ? l : -1;
+}