LeetCode Question: 2279. Maximum Bags With Full Capacity of Rocks (Level : Medium)
Note:- Scroll horizontally to see the full line of code.
class Solution
{
public:
int maximumBags(vector<int> &capacity, vector<int> &rocks, int additionalRocks)
{
vector<int> availability;
int n = capacity.size();
for (int i = 0; i < n; i++)
{
int availableSpace = capacity[i] - rocks[i];
availability.push_back(availableSpace);
}
sort(availability.begin(), availability.end());
int ans = 0;
for (int i = 0; i < n; i++)
{
if (availability[i] != 0)
{
if (availability[i] <= additionalRocks)
{
additionalRocks -= availability[i];
ans++;
}
else
{
return ans;
}
}
else
{
ans++;
}
}
return ans;
}
};
Comments
Post a Comment