feat: update solutions to lc problem: No.1870

No.1870.Minimum Speed to Arrive on Time

Author: yanglbme

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

@@ -136,14 +136,9 @@ class Solution:
                 res += (d / speed) if i == len(dist) - 1 else math.ceil(d / speed)
             return res <= hour
 
-        left, right = 1, 10**7
-        while left < right:
-            mid = (left + right) >> 1
-            if check(mid):
-                right = mid
-            else:
-                left = mid + 1
-        return left if check(left) else -1
+        r = 10**7 + 1
+        ans = bisect_left(range(1, r), True, key=check) + 1
+        return -1 if ans == r else ans
 ```
 
 ### **Java**
@@ -205,6 +200,28 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func minSpeedOnTime(dist []int, hour float64) int {
+	n := len(dist)
+	const mx int = 1e7
+	x := sort.Search(mx, func(s int) bool {
+		s++
+		var cost float64
+		for _, v := range dist[:n-1] {
+			cost += math.Ceil(float64(v) / float64(s))
+		}
+		cost += float64(dist[n-1]) / float64(s)
+		return cost <= hour
+	})
+	if x == mx {
+		return -1
+	}
+	return x + 1
+}
+```
+
 ### **JavaScript**
 
 ```js
@@ -242,30 +259,6 @@ function arriveOnTime(dist, speed, hour) {
 }
 ```
 
-### **Go**
-
-```go
-func minSpeedOnTime(dist []int, hour float64) int {
-	n := len(dist)
-	const mx int = 1e7 + 1
-	x := sort.Search(mx, func(s int) bool {
-		if s == 0 {
-			return false
-		}
-		var cost float64
-		for _, v := range dist[:n-1] {
-			cost += math.Ceil(float64(v) / float64(s))
-		}
-		cost += float64(dist[n-1]) / float64(s)
-		return cost <= hour
-	})
-	if x < 0 || x == mx {
-		return -1
-	}
-	return x
-}
-```
-
 ### **Rust**
 
 ```rust

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

@@ -113,14 +113,9 @@ class Solution:
                 res += (d / speed) if i == len(dist) - 1 else math.ceil(d / speed)
             return res <= hour
 
-        left, right = 1, 10**7
-        while left < right:
-            mid = (left + right) >> 1
-            if check(mid):
-                right = mid
-            else:
-                left = mid + 1
-        return left if check(left) else -1
+        r = 10**7 + 1
+        ans = bisect_left(range(1, r), True, key=check) + 1
+        return -1 if ans == r else ans
 ```
 
 ### **Java**
@@ -180,6 +175,28 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func minSpeedOnTime(dist []int, hour float64) int {
+	n := len(dist)
+	const mx int = 1e7
+	x := sort.Search(mx, func(s int) bool {
+		s++
+		var cost float64
+		for _, v := range dist[:n-1] {
+			cost += math.Ceil(float64(v) / float64(s))
+		}
+		cost += float64(dist[n-1]) / float64(s)
+		return cost <= hour
+	})
+	if x == mx {
+		return -1
+	}
+	return x + 1
+}
+```
+
 ### **JavaScript**
 
 ```js
@@ -217,30 +234,6 @@ function arriveOnTime(dist, speed, hour) {
 }
 ```
 
-### **Go**
-
-```go
-func minSpeedOnTime(dist []int, hour float64) int {
-	n := len(dist)
-	const mx int = 1e7 + 1
-	x := sort.Search(mx, func(s int) bool {
-		if s == 0 {
-			return false
-		}
-		var cost float64
-		for _, v := range dist[:n-1] {
-			cost += math.Ceil(float64(v) / float64(s))
-		}
-		cost += float64(dist[n-1]) / float64(s)
-		return cost <= hour
-	})
-	if x < 0 || x == mx {
-		return -1
-	}
-	return x
-}
-```
-
 ### **Rust**
 
 ```rust

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

@@ -1,19 +1,17 @@
 func minSpeedOnTime(dist []int, hour float64) int {
 	n := len(dist)
-	const mx int = 1e7 + 1
+	const mx int = 1e7
 	x := sort.Search(mx, func(s int) bool {
-		if s == 0 {
-			return false
-		}
+		s++
 		var cost float64
 		for _, v := range dist[:n-1] {
 			cost += math.Ceil(float64(v) / float64(s))
 		}
 		cost += float64(dist[n-1]) / float64(s)
 		return cost <= hour
 	})
-	if x < 0 || x == mx {
+	if x == mx {
 		return -1
 	}
-	return x
+	return x + 1
 }

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

@@ -1,16 +1,11 @@
 class Solution:
     def minSpeedOnTime(self, dist: List[int], hour: float) -> int:
-        def arrive_on_time(speed):
+        def check(speed):
             res = 0
             for i, d in enumerate(dist):
                 res += (d / speed) if i == len(dist) - 1 else math.ceil(d / speed)
             return res <= hour
 
-        left, right = 1, 10**7
-        while left < right:
-            mid = (left + right) >> 1
-            if arrive_on_time(mid):
-                right = mid
-            else:
-                left = mid + 1
-        return left if arrive_on_time(left) else -1
+        r = 10**7 + 1
+        ans = bisect_left(range(1, r), True, key=check) + 1
+        return -1 if ans == r else ans