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/earliest_possible_full_bloom.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/earliest_possible_full_bloom.cpp')
-rw-r--r-- | other/earliest_possible_full_bloom.cpp | 26 |
1 files changed, 0 insertions, 26 deletions
diff --git a/other/earliest_possible_full_bloom.cpp b/other/earliest_possible_full_bloom.cpp deleted file mode 100644 index f990e62..0000000 --- a/other/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); -} |