aboutsummaryrefslogtreecommitdiff
path: root/earliest_possible_full_bloom.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'earliest_possible_full_bloom.cpp')
-rw-r--r--earliest_possible_full_bloom.cpp26
1 files changed, 0 insertions, 26 deletions
diff --git a/earliest_possible_full_bloom.cpp b/earliest_possible_full_bloom.cpp
deleted file mode 100644
index f990e62..0000000
--- a/earliest_possible_full_bloom.cpp
+++ /dev/null
@@ -1,26 +0,0 @@
-#include "leetcode.h"
-
-class Solution {
-public:
- int earliestFullBloom(vector<int> &plantTime, vector<int> &growTime) {
- int n = plantTime.size();
- vector<pair<int, int>> times(n);
- for (int i = 0; i < n; i++) {
- times[i].first = -growTime[i];
- times[i].second = plantTime[i];
- }
- sort(times.begin(), times.end());
- int total = 0, curr = 0;
- for (int i = 0; i < n; i++) {
- total = max(total, curr + times[i].second - times[i].first);
- curr += times[i].second;
- }
- return total;
- }
-};
-
-int main() {
- Solution obj;
- vector<int> plantTime = {1, 4, 3}, growTime = {2, 3, 1};
- cout << obj.earliestFullBloom(plantTime, growTime);
-}