Minimum Time to Complete Trips LeetCode solution in Java

1
class Solution {
2
  public long minimumTime(int[] time, int totalTrips) {
3
    long anstillnow = -1;
4

5
    long left = 1, right = 100000000000001L;
6

7
    while (left <= right) {
8
      long mid = left + (right - left) / 2; // find mid point like this to avoid overflow
9
      long curr_trips = 0;
10
      for (int t : time) {
11
        curr_trips += mid / t;
12
      }
13

14
      if (curr_trips >= totalTrips) {
15
        anstillnow = mid;
16
        right = mid - 1;
17
      } else {
18
        left = mid + 1;
19
      }
20
    }
21

22
    return anstillnow;
23
  }
24
}