2008. Maximum Earnings From Taxi: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1513,3 +1513,4 @@ mod s2002_maximum_product_of_the_length_of_two_palindromic_subsequences;
 mod s2003_smallest_missing_genetic_value_in_each_subtree;
 mod s2006_count_number_of_pairs_with_absolute_difference_k;
 mod s2007_find_original_array_from_doubled_array;
+mod s2008_maximum_earnings_from_taxi;

src/solution/s2008_maximum_earnings_from_taxi.rs

@@ -0,0 +1,82 @@
+/**
+ * [2008] Maximum Earnings From Taxi
+ *
+ * There are n points on a road you are driving your taxi on. The n points on the road are labeled from 1 to n in the direction you are going, and you want to drive from point 1 to point n to make money by picking up passengers. You cannot change the direction of the taxi.
+ * The passengers are represented by a 0-indexed 2D integer array rides, where rides[i] = [starti, endi, tipi] denotes the i^th passenger requesting a ride from point starti to point endi who is willing to give a tipi dollar tip.
+ * For each passenger i you pick up, you earn endi - starti + tipi dollars. You may only drive at most one passenger at a time.
+ * Given n and rides, return the maximum number of dollars you can earn by picking up the passengers optimally.
+ * Note: You may drop off a passenger and pick up a different passenger at the same point.
+ *  
+ * Example 1:
+ *
+ * Input: n = 5, rides = [<u>[2,5,4]</u>,[1,5,1]]
+ * Output: 7
+ * Explanation: We can pick up passenger 0 to earn 5 - 2 + 4 = 7 dollars.
+ *
+ * Example 2:
+ *
+ * Input: n = 20, rides = [[1,6,1],<u>[3,10,2]</u>,<u>[10,12,3]</u>,[11,12,2],[12,15,2],<u>[13,18,1]</u>]
+ * Output: 20
+ * Explanation: We will pick up the following passengers:
+ * - Drive passenger 1 from point 3 to point 10 for a profit of 10 - 3 + 2 = 9 dollars.
+ * - Drive passenger 2 from point 10 to point 12 for a profit of 12 - 10 + 3 = 5 dollars.
+ * - Drive passenger 5 from point 13 to point 18 for a profit of 18 - 13 + 1 = 6 dollars.
+ * We earn 9 + 5 + 6 = 20 dollars in total.
+ *  
+ * Constraints:
+ *
+ * 	1 <= n <= 10^5
+ * 	1 <= rides.length <= 3 * 10^4
+ * 	rides[i].length == 3
+ * 	1 <= starti < endi <= n
+ * 	1 <= tipi <= 10^5
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/maximum-earnings-from-taxi/
+// discuss: https://leetcode.com/problems/maximum-earnings-from-taxi/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn max_taxi_earnings(n: i32, rides: Vec<Vec<i32>>) -> i64 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2008_example_1() {
+        let n = 5;
+        let rides = vec![vec![2, 5, 4], vec![1, 5, 1]];
+
+        let result = 7;
+
+        assert_eq!(Solution::max_taxi_earnings(n, rides), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2008_example_2() {
+        let n = 20;
+        let rides = vec![
+            vec![1, 6, 1],
+            vec![3, 10, 2],
+            vec![10, 12, 3],
+            vec![11, 12, 2],
+            vec![12, 15, 2],
+            vec![13, 18, 1],
+        ];
+
+        let result = 20;
+
+        assert_eq!(Solution::max_taxi_earnings(n, rides), result);
+    }
+}