2187. Minimum Time to Complete Trips: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1653,3 +1653,4 @@ mod s2182_construct_string_with_repeat_limit;
 mod s2183_count_array_pairs_divisible_by_k;
 mod s2185_counting_words_with_a_given_prefix;
 mod s2186_minimum_number_of_steps_to_make_two_strings_anagram_ii;
+mod s2187_minimum_time_to_complete_trips;

src/solution/s2187_minimum_time_to_complete_trips.rs

@@ -0,0 +1,76 @@
+/**
+ * [2187] Minimum Time to Complete Trips
+ *
+ * You are given an 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.
+ * You are also given an integer totalTrips, which denotes the number of trips all buses should make in total. Return the minimum time required for all buses to complete at least totalTrips trips.
+ *  
+ * Example 1:
+ *
+ * Input: time = [1,2,3], totalTrips = 5
+ * Output: 3
+ * Explanation:
+ * - At time t = 1, the number of trips completed by each bus are [1,0,0].
+ *   The total number of trips completed is 1 + 0 + 0 = 1.
+ * - At time t = 2, the number of trips completed by each bus are [2,1,0].
+ *   The total number of trips completed is 2 + 1 + 0 = 3.
+ * - At time t = 3, the number of trips completed by each bus are [3,1,1].
+ *   The total number of trips completed is 3 + 1 + 1 = 5.
+ * So the minimum time needed for all buses to complete at least 5 trips is 3.
+ *
+ * Example 2:
+ *
+ * Input: time = [2], totalTrips = 1
+ * Output: 2
+ * Explanation:
+ * There is only one bus, and it will complete its first trip at t = 2.
+ * So the minimum time needed to complete 1 trip is 2.
+ *
+ *  
+ * Constraints:
+ *
+ * 	1 <= time.length <= 10^5
+ * 	1 <= time[i], totalTrips <= 10^7
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/minimum-time-to-complete-trips/
+// discuss: https://leetcode.com/problems/minimum-time-to-complete-trips/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn minimum_time(time: Vec<i32>, total_trips: i32) -> i64 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2187_example_1() {
+        let time = vec![1, 2, 3];
+        let total_trips = 5;
+
+        let result = 3;
+
+        assert_eq!(Solution::minimum_time(time, total_trips), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2187_example_2() {
+        let time = vec![2];
+        let total_trips = 1;
+
+        let result = 2;
+
+        assert_eq!(Solution::minimum_time(time, total_trips), result);
+    }
+}