aboutsummaryrefslogtreecommitdiff
path: root/other/min_time_complete_trip.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'other/min_time_complete_trip.cpp')
-rw-r--r--other/min_time_complete_trip.cpp36
1 files changed, 0 insertions, 36 deletions
diff --git a/other/min_time_complete_trip.cpp b/other/min_time_complete_trip.cpp
deleted file mode 100644
index 2e325a2..0000000
--- a/other/min_time_complete_trip.cpp
+++ /dev/null
@@ -1,36 +0,0 @@
-// 2187. Minimum Time to Complete Trips
-#include "leetcode.h"
-
-/*
- * given array 'time' where 'time[i]' denotes the time taken by the 'i'th bus to
- * complete one trip. each bus can make multiple trips successively; that is,
- * the next trip can start immediately after completing the current trip. also,
- * each bus operates independently; that is, the trips of one bus do not
- * influence the trips of any other bus. also given an integer 'totalTrips',
- * which denotes the number of trips all buses should make in total. return the
- * minimum time required to complete all trips.
- */
-
-class Solution {
-public:
- long long minimumTime(vector<int> &time, int totalTrips) {
- long long l = 0, r = LLONG_MAX / time.size();
- while (l < r) {
- long long m = (l + r) / 2, trips = 0;
- for (int t : time)
- trips += m / t;
- if (trips < totalTrips)
- l = m + 1;
- else
- r = m;
- }
- return l;
- }
-};
-
-int main() {
- Solution obj;
- vector<int> t1 = {1, 2, 3}, t2 = {2};
- printf("%lld\n", obj.minimumTime(t1, 5)); // expect: 3
- printf("%lld\n", obj.minimumTime(t2, 1)); // expect: 2
-}