In this guide, you will get 1710. Maximum Units on a Truck LeetCode Solution with the best time and space complexity. The solution to Maximum Units on a Truck problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
You are assigned to put some amount of boxes onto one truck. You are given a 2D array boxTypes, where boxTypes[i] = [numberOfBoxesi, numberOfUnitsPerBoxi]:
numberOfBoxesi is the number of boxes of type i.
numberOfUnitsPerBoxi is the number of units in each box of the type i.
You are also given an integer truckSize, which is the maximum number of boxes that can be put on the truck. You can choose any boxes to put on the truck as long as the number of boxes does not exceed truckSize.
Return the maximum total number of units that can be put on the truck.
Example 1:
Input: boxTypes = [[1,3],[2,2],[3,1]], truckSize = 4
Output: 8
Explanation: There are:
– 1 box of the first type that contains 3 units.
– 2 boxes of the second type that contain 2 units each.
– 3 boxes of the third type that contain 1 unit each.
You can take all the boxes of the first and second types, and one box of the third type.
The total number of units will be = (1 * 3) + (2 * 2) + (1 * 1) = 8.
1710. Maximum Units on a Truck LeetCode Solution in C++
class Solution {
public:
int maximumUnits(vector<vector<int>>& boxTypes, int truckSize) {
int ans = 0;
ranges::sort(boxTypes, ranges::greater{},
[](const vector<int>& boxType) { return boxType[1]; });
for (const vector<int>& boxType : boxTypes) {
const int boxes = boxType[0];
const int units = boxType[1];
if (boxes >= truckSize)
return ans + truckSize * units;
ans += boxes * units;
truckSize -= boxes;
}
return ans;
}
}; /* code provided by PROGIEZ */
1710. Maximum Units on a Truck LeetCode Solution in Java
class Solution {
public int maximumUnits(int[][] boxTypes, int truckSize) {
int ans = 0;
Arrays.sort(boxTypes, (a, b) -> Integer.compare(b[1], a[1]));
for (int[] boxType : boxTypes) {
final int boxes = boxType[0];
final int units = boxType[1];
if (boxes >= truckSize)
return ans + truckSize * units;
ans += boxes * units;
truckSize -= boxes;
}
return ans;
}
} // code provided by PROGIEZ
1710. Maximum Units on a Truck LeetCode Solution in Python
class Solution:
def maximumUnits(self, boxTypes: list[list[int]], truckSize: int) -> int:
ans = 0
for boxes, units in sorted(boxTypes, key=lambda x: -x[1]):
if boxes >= truckSize:
return ans + truckSize * units
ans += boxes * units
truckSize -= boxes
return ans # code by PROGIEZ
