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_bags_rocks.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/max_bags_rocks.cpp')
-rw-r--r-- | other/max_bags_rocks.cpp | 22 |
1 files changed, 0 insertions, 22 deletions
diff --git a/other/max_bags_rocks.cpp b/other/max_bags_rocks.cpp deleted file mode 100644 index 35c66bc..0000000 --- a/other/max_bags_rocks.cpp +++ /dev/null @@ -1,22 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int maximumBags(vector<int> &capacity, vector<int> &rocks, - int additionalRocks) { - vector<int> count; - int n = rocks.size(), ans; - for (int i = 0; i < n; ++i) - count.push_back(capacity[i] - rocks[i]); - sort(count.begin(), count.end()); - for (ans = 0; ans < n && additionalRocks >= count[ans]; ++ans) - additionalRocks -= count[ans]; - return ans; - } -}; - -int main() { - Solution obj; - vector<int> capacity = {2, 3, 4, 5}, rocks = {1, 2, 4, 4}; - cout << obj.maximumBags(capacity, rocks, 2); -} |