add: 出租车的最大盈利

Author: yi-ge

README.md

@@ -573,6 +573,10 @@ C++标准库提供的数据结构实在是太多了，参考[C++标准库头文
 
 ### 排序
 
+- [出租车的最大盈利](src/sort/maximum_earnings_from_taxi.cpp)  [数组, 二分查找, 动态规划, 排序]
+
+  - LeetCode 2008. 出租车的最大盈利 <https://leetcode.cn/problems/maximum-earnings-from-taxi>
+
 - [拼车](src/sort/car_pooling.cpp)  [数组, 前缀和, 排序, 模拟, 堆（优先队列）]
 
   - LeetCode 1094. 拼车 <https://leetcode.cn/problems/car-pooling>

images/sort/maximum_earnings_from_taxi.jpeg

@@ -26,7 +26,7 @@
     "postinstall": "node ./scripts/postinstall.cjs"
   },
   "dependencies": {
-    "leetcode-test-helper": "^0.4.7",
+    "leetcode-test-helper": "^0.4.8",
     "puppeteer": "^15.3.0",
     "puppeteer-extra": "^3.3.1",
     "puppeteer-extra-plugin-stealth": "^2.10.2",

package.json

@@ -0,0 +1,25 @@
+// 出租车的最大盈利
+// https://leetcode.cn/problems/maximum-earnings-from-taxi
+// INLINE  ../../images/sort/maximum_earnings_from_taxi.jpeg
+
+#include <headers.hpp>
+
+class Solution {
+public:
+  long long maxTaxiEarnings(int n, vector<vector<int>> &rides) {
+    sort(
+        rides.begin(), rides.end(),
+        [](const vector<int> &a, const vector<int> &b) { return a[1] < b[1]; });
+    vector<long long> dp(n + 1, 0);
+    int j = 0;
+    for (int i = 1; i <= n; ++i) {
+      dp[i] = dp[i - 1];
+      while (j < rides.size() && rides[j][1] == i) {
+        dp[i] = max(dp[i],
+                    dp[rides[j][0]] + rides[j][1] - rides[j][0] + rides[j][2]);
+        ++j;
+      }
+    }
+    return dp[n];
+  }
+};

src/sort/maximum_earnings_from_taxi.cpp

@@ -1,4 +1,4 @@
-// 执行编译时间：2023-12-07 11:57:41
+// 执行编译时间：2023-12-08 10:26:51
 #include <gtest/gtest.h>
 #include <lib.hpp>
 

test/lib/lib_test.cpp

@@ -0,0 +1,25 @@
+#include <sort/maximum_earnings_from_taxi.cpp>
+
+TEST(出租车的最大盈利, maxTaxiEarnings) {
+  Solution solution;
+  // 示例 1：
+  // 输入：n = 5, rides = [[2,5,4],[1,5,1]]
+  // 输出：7
+  // 解释：我们可以接乘客 0 的订单，获得 5 - 2 + 4 = 7 元。
+  int n = 5;
+  vector<vector<int>> rides = {{2, 5, 4}, {1, 5, 1}};
+  EXPECT_EQ(solution.maxTaxiEarnings(n, rides), 7);
+
+  // 示例 2：
+  // 输入：n = 20, rides =
+  // [[1,6,1],[3,10,2],[10,12,3],[11,12,2],[12,15,2],[13,18,1]] 输出：20
+  // 解释：我们可以接以下乘客的订单：
+  // - 将乘客 1 从地点 3 送往地点 10 ，获得 10 - 3 + 2 = 9 元。
+  // - 将乘客 2 从地点 10 送往地点 12 ，获得 12 - 10 + 3 = 5 元。
+  // - 将乘客 5 从地点 13 送往地点 18 ，获得 18 - 13 + 1 = 6 元。
+  // 我们总共获得 9 + 5 + 6 = 20 元。
+  n = 20;
+  rides = {{1, 6, 1},   {3, 10, 2},  {10, 12, 3},
+           {11, 12, 2}, {12, 15, 2}, {13, 18, 1}};
+  EXPECT_EQ(solution.maxTaxiEarnings(n, rides), 20);
+}

test/sort/maximum_earnings_from_taxi_test.cpp

@@ -422,10 +422,10 @@ lazy-cache@^1.0.3:
   resolved "https://registry.yarnpkg.com/lazy-cache/-/lazy-cache-1.0.4.tgz#a1d78fc3a50474cb80845d3b3b6e1da49a446e8e"
   integrity sha512-RE2g0b5VGZsOCFOCgP7omTRYFqydmZkBwl5oNnQ1lDYC57uyO9KqNnNVxT7COSHTxrRCWVcAVOcbjk+tvh/rgQ==
 
-leetcode-test-helper@^0.4.7:
-  version "0.4.7"
-  resolved "https://registry.yarnpkg.com/leetcode-test-helper/-/leetcode-test-helper-0.4.7.tgz#7798cdf1c322f1ed452b8b26d56b769a5c732aed"
-  integrity sha512-ULRnWlvIMhduzAvUdxAh1moyrraOLsm5CmA0chYXZYo7OSfpnp176B6JDca+lFGvrPvRLicDzB+3rmi1uHz0xg==
+leetcode-test-helper@^0.4.8:
+  version "0.4.8"
+  resolved "https://registry.yarnpkg.com/leetcode-test-helper/-/leetcode-test-helper-0.4.8.tgz#150213bc6ec96cf84117d5256272b0c61dcd3dae"
+  integrity sha512-AQp5cNKW9QQ0SqroUQ/zAeajIEiIIEMlebTfLK2n1pusb65GLse8IkqPDuzvwerQPZgVgn/hHndrVhjZ34xNvw==
   dependencies:
     playwright "^1.38.0"
     playwright-extra "^4.3.6"