diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/max_profit_job.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/max_profit_job.cpp')
-rw-r--r-- | other/max_profit_job.cpp | 28 |
1 files changed, 0 insertions, 28 deletions
diff --git a/other/max_profit_job.cpp b/other/max_profit_job.cpp deleted file mode 100644 index 811874b..0000000 --- a/other/max_profit_job.cpp +++ /dev/null @@ -1,28 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int jobScheduling(vector<int> &startTime, vector<int> &endTime, - vector<int> &profit) { - int n = startTime.size(); - vvd jobs; - for (int i = 0; i < n; ++i) - jobs.push_back({endTime[i], startTime[i], profit[i]}); - sort(jobs.begin(), jobs.end()); - map<int, int> dp = {{0, 0}}; - for (auto &j : jobs) { - int curr = prev(dp.upper_bound(j[1]))->second + j[2]; - if (curr > dp.rbegin()->second) - dp[j[0]] = curr; - } - return dp.rbegin()->second; - } -}; - -int main() { - Solution obj; - vector<int> startTime = {1, 2, 3, 3}; - vector<int> endTime = {3, 4, 5, 6}; - vector<int> profit = {50, 10, 40, 70}; - cout << obj.jobScheduling(startTime, endTime, profit); // 120 -} |