Minimum Time to Complete Trips LeetCode solution in Python

1
class Solution(object):
2
    def minimumTime(self, time, totalTrips):
3
        anstillnow = -1
4
        left = 1
5
        right = 100000000000001
6

7
        while left <= right:
8
            mid = (
9
                left + (right - left) / 2
10
            )  # find mid point like this to avoid overflow
11

12
            curr_trips = 0
13

14
            for t in time:
15
                curr_trips += mid / t
16

17
            if curr_trips >= totalTrips:
18
                anstillnow = mid
19
                right = mid - 1
20

21
            else:
22
                left = mid + 1
23

24
        return anstillnow